%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT009-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:01:08 PM UTC 2026
% Result : Unsatisfiable 2.90s 1.10s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 10 unt; 0 def)
% Number of atoms : 80 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 88 ( 45 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 80 !; 0 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( product(X0,X1,compose(X0,X1))
| ~ defined(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',closure_of_composition) ).
fof(f2,axiom,
! [X2,X0,X1] :
( defined(X0,X1)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',associative_property1) ).
fof(f3,axiom,
! [X2,X3,X0,X1] :
( defined(X1,X3)
| ~ defined(X2,X3)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',associative_property2) ).
fof(f7,axiom,
! [X2,X3,X0,X1,X4] :
( defined(X4,X1)
| ~ defined(X3,X2)
| ~ product(X3,X0,X4)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',category_theory_axiom4) ).
fof(f10,axiom,
! [X0] : identity_map(domain(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',domain_is_an_identity_map) ).
fof(f14,axiom,
! [X0] : product(X0,domain(X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',product_on_domain) ).
fof(f16,axiom,
! [X0,X1] :
( product(X0,X1,X1)
| ~ identity_map(X0)
| ~ defined(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',identity1) ).
fof(f17,axiom,
! [X0,X1] :
( product(X0,X1,X0)
| ~ identity_map(X1)
| ~ defined(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',identity2) ).
fof(f18,axiom,
! [X2,X3,X0,X1] :
( X2 = X3
| ~ product(X0,X1,X3)
| ~ product(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',composition_is_well_defined) ).
fof(f19,axiom,
defined(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ba_defined) ).
fof(f20,negated_conjecture,
domain(compose(b,a)) != domain(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_ba_equals_domain_of_a) ).
tcf(c_69,plain,
defined(b,a),
inference(cnf_transformation,[],[f19]) ).
tcf(c_70,negated_conjecture,
domain(compose(b,a)) != domain(a),
inference(cnf_transformation,[],[f20]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( defined(X4,X1)
| ~ defined(X3,X2)
| ~ product(X3,X0,X4)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( defined(X1,X3)
| ~ defined(X2,X3)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[],[f3]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] :
( defined(X0,X1)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X2 = X3 )
| ~ product(X0,X1,X3)
| ~ product(X0,X1,X2) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_77,plain,
! [X0: $i,X1: $i] :
( product(X0,X1,compose(X0,X1))
| ~ defined(X0,X1) ),
inference(cnf_transformation,[],[f1]) ).
tcf(c_78,plain,
! [X0: $i] : product(X0,domain(X0),X0),
inference(cnf_transformation,[],[f14]) ).
tcf(c_80,plain,
! [X0: $i] : identity_map(domain(X0)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( product(X0,X1,X0)
| ~ identity_map(X1)
| ~ defined(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] :
( product(X0,X1,X1)
| ~ identity_map(X0)
| ~ defined(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_265,plain,
! [X0: $i,X1: $i,X2: $i] :
( product(X2,X1,X2)
| ~ defined(X2,X1)
| ( domain(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_83,c_80]) ).
tcf(c_266,plain,
! [X0: $i,X1: $i] :
( product(X0,domain(X1),X0)
| ~ defined(X0,domain(X1)) ),
inference(unflattening,[status(thm)],[c_265]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i,X2: $i] :
( product(X1,X2,X2)
| ~ defined(X1,X2)
| ( domain(X0) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_80,c_84]) ).
tcf(c_286,plain,
! [X0: $i,X1: $i] :
( product(domain(X0),X1,X1)
| ~ defined(domain(X0),X1) ),
inference(unflattening,[status(thm)],[c_285]) ).
tcf(c_754,plain,
! [X0: $i,X1: $i] :
( defined(domain(X0),X1)
| ~ defined(X0,X1) ),
inference(superposition,[status(thm)],[c_78,c_74]) ).
tcf(c_774,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ~ defined(X0,domain(X1))
| ~ product(X0,domain(X1),X2) ),
inference(superposition,[status(thm)],[c_266,c_76]) ).
tcf(c_797,plain,
! [X0: $i,X1: $i,X2: $i] :
( defined(X2,domain(X1))
| ~ defined(X0,X1)
| ~ product(X0,X1,X2) ),
inference(superposition,[status(thm)],[c_78,c_71]) ).
tcf(c_1255,plain,
! [X0: $i,X1: $i,X2: $i] :
( defined(X2,domain(X1))
| ~ product(X0,X1,X2) ),
inference(global_subsumption_just,[status(thm)],[c_797,c_75,c_797]) ).
tcf(c_1261,plain,
! [X0: $i,X1: $i] :
( defined(compose(X0,X1),domain(X1))
| ~ defined(X0,X1) ),
inference(superposition,[status(thm)],[c_77,c_1255]) ).
tcf(c_1649,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ~ product(X0,domain(X1),X2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_774,c_75]) ).
tcf(c_1659,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = domain(X1) )
| ~ defined(domain(X0),domain(X1)) ),
inference(superposition,[status(thm)],[c_286,c_1649]) ).
tcf(c_2329,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = domain(X1) )
| ~ defined(X0,domain(X1)) ),
inference(superposition,[status(thm)],[c_754,c_1659]) ).
tcf(c_2380,plain,
! [X0: $i,X1: $i] :
( ( domain(compose(X0,X1)) = domain(X1) )
| ~ defined(X0,X1) ),
inference(superposition,[status(thm)],[c_1261,c_2329]) ).
tcf(c_2453,plain,
domain(compose(b,a)) = domain(a),
inference(superposition,[status(thm)],[c_69,c_2380]) ).
tcf(c_2469,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2453,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n017.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 06:48:48 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.43 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 2.90/1.10 % SZS status Started for theBenchmark.p
% 2.90/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.90/1.10
% 2.90/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.90/1.10
% 2.90/1.10 % ------ iProver source info
% 2.90/1.10
% 2.90/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 2.90/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.90/1.10 % git: non_committed_changes: false
% 2.90/1.10
% 2.90/1.10 % ------ Parsing...% successful
% 2.90/1.10
% 2.90/1.10
% 2.90/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.90/1.10
% 2.90/1.10 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 2.90/1.10
% 2.90/1.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.90/1.10
% 2.90/1.10 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.90/1.10 % ------ Proving...
% 2.90/1.10 % ------ Problem Properties
% 2.90/1.10
% 2.90/1.10 %
% 2.90/1.10 % clauses 16
% 2.90/1.10 % conjectures 1
% 2.90/1.10 % EPR 9
% 2.90/1.10 % Horn 16
% 2.90/1.10 % unary 4
% 2.90/1.10 % binary 4
% 2.90/1.10 % lits 40
% 2.90/1.10 % lits eq 2
% 2.90/1.10 % fd_pure 0
% 2.90/1.10 % fd_pseudo 0
% 2.90/1.10 % fd_cond 0
% 2.90/1.10 % fd_pseudo_cond 1
% 2.90/1.10 % AC symbols 0
% 2.90/1.10
% 2.90/1.10 % ------ Schedule dynamic 5 is on
% 2.90/1.10
% 2.90/1.10 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.90/1.10
% 2.90/1.10
% 2.90/1.10 % ------
% 2.90/1.10 % Current options:
% 2.90/1.10 % ------
% 2.90/1.10
% 2.90/1.10
% 2.90/1.10 %
% 2.90/1.10
% 2.90/1.10 % ------ Proving...
% 2.90/1.10 %
% 2.90/1.10
% 2.90/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.90/1.10
% 2.90/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.90/1.10
% 2.90/1.10
%------------------------------------------------------------------------------