%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CAT009-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.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 1.21s 1.29s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 25 unt; 3 def)
% Number of atoms : 95 ( 25 equ)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 39 ( 21 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_has_elements) ).
fof(f5,axiom,
! [X0] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',codomain_has_elements) ).
fof(f6,axiom,
! [X0,X1] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',composition_implies_domain) ).
fof(f7,axiom,
! [X0,X1] :
( domain(X0) = codomain(X1)
| ~ there_exists(compose(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',domain_codomain_composition1) ).
fof(f9,axiom,
! [X2,X0,X1] : compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).
fof(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/CAT004-0.ax',compose_domain) ).
fof(f12,axiom,
there_exists(compose(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ab_exists) ).
fof(f13,negated_conjecture,
domain(compose(a,b)) != domain(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_of_ab_equals_domain_of_b) ).
tcf(c_65,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(domain(X0)) ),
inference(cnf_transformation,[],[f4]) ).
tcf(c_66,plain,
! [X0: $i] :
( there_exists(X0)
| ~ there_exists(codomain(X0)) ),
inference(cnf_transformation,[],[f5]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( there_exists(domain(X0))
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ( domain(X0) = codomain(X1) )
| ~ there_exists(compose(X0,X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] : compose(compose(X0,X1),X2) = compose(X0,compose(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_71,plain,
! [X0: $i] : compose(X0,domain(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_73,plain,
there_exists(compose(a,b)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_74,negated_conjecture,
domain(compose(a,b)) != domain(b),
inference(cnf_transformation,[],[f13]) ).
tcf(c_230,definition,
iPr_def_10 = compose(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_231,definition,
iPr_def_11 = domain(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_232,definition,
iPr_def_12 = domain(b),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_233,negated_conjecture,
iPr_def_11 != iPr_def_12,
inference(demodulation,[status(thm)],[c_74,c_232,c_230,c_231]) ).
tcf(c_370,plain,
there_exists(iPr_def_10),
inference(light_normalisation,[status(thm)],[c_73,c_230]) ).
tcf(c_373,plain,
( there_exists(b)
| ~ there_exists(iPr_def_12) ),
inference(superposition,[status(thm)],[c_232,c_65]) ).
tcf(c_385,plain,
! [X0: $i] : compose(a,compose(b,X0)) = compose(iPr_def_10,X0),
inference(superposition,[status(thm)],[c_230,c_70]) ).
tcf(c_391,plain,
compose(b,iPr_def_12) = b,
inference(superposition,[status(thm)],[c_232,c_71]) ).
tcf(c_403,plain,
( there_exists(domain(a))
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_230,c_67]) ).
tcf(c_409,plain,
there_exists(domain(a)),
inference(forward_subsumption_resolution,[status(thm)],[c_403,c_370]) ).
tcf(c_421,plain,
( ( domain(a) = codomain(b) )
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_230,c_68]) ).
tcf(c_425,plain,
domain(a) = codomain(b),
inference(forward_subsumption_resolution,[status(thm)],[c_421,c_370]) ).
tcf(c_436,plain,
( ( domain(b) = codomain(iPr_def_12) )
| ~ there_exists(b) ),
inference(superposition,[status(thm)],[c_391,c_68]) ).
tcf(c_437,plain,
( there_exists(domain(b))
| ~ there_exists(b) ),
inference(superposition,[status(thm)],[c_391,c_67]) ).
tcf(c_439,plain,
( there_exists(iPr_def_12)
| ~ there_exists(b) ),
inference(light_normalisation,[status(thm)],[c_437,c_232]) ).
tcf(c_442,plain,
( ( codomain(iPr_def_12) = iPr_def_12 )
| ~ there_exists(b) ),
inference(light_normalisation,[status(thm)],[c_436,c_232]) ).
tcf(c_478,plain,
( there_exists(b)
| ~ there_exists(domain(a)) ),
inference(superposition,[status(thm)],[c_425,c_66]) ).
tcf(c_479,plain,
there_exists(b),
inference(forward_subsumption_resolution,[status(thm)],[c_478,c_409]) ).
tcf(c_480,plain,
there_exists(iPr_def_12),
inference(backward_subsumption_resolution,[status(thm)],[c_439,c_479]) ).
tcf(c_489,plain,
compose(a,b) = compose(iPr_def_10,iPr_def_12),
inference(superposition,[status(thm)],[c_391,c_385]) ).
tcf(c_493,plain,
compose(iPr_def_10,iPr_def_12) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_489,c_230]) ).
tcf(c_546,plain,
( ( domain(iPr_def_10) = codomain(iPr_def_12) )
| ~ there_exists(iPr_def_10) ),
inference(superposition,[status(thm)],[c_493,c_68]) ).
tcf(c_549,plain,
( ( codomain(iPr_def_12) = iPr_def_11 )
| ~ there_exists(iPr_def_10) ),
inference(light_normalisation,[status(thm)],[c_546,c_231]) ).
tcf(c_550,plain,
codomain(iPr_def_12) = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_549,c_370]) ).
tcf(c_590,plain,
codomain(iPr_def_12) = iPr_def_12,
inference(global_subsumption_just,[status(thm)],[c_442,c_373,c_442,c_480]) ).
tcf(c_592,plain,
iPr_def_11 = iPr_def_12,
inference(light_normalisation,[status(thm)],[c_590,c_550]) ).
tcf(c_593,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_592,c_233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CAT009-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n007.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 06:51:57 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.42
% 0.08/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.42
% 0.08/0.42 % Detected problem language: tptp
% 0.08/0.43 % Proving...
% 1.21/1.29 % SZS status Started for theBenchmark.p
% 1.21/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.29
% 1.21/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.21/1.29
% 1.21/1.29 % ------ iProver source info
% 1.21/1.29
% 1.21/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.21/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.21/1.29 % git: non_committed_changes: false
% 1.21/1.29
% 1.21/1.29 % ------ Parsing...% successful
% 1.21/1.29
% 1.21/1.29
% 1.21/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.21/1.29
% 1.21/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.21/1.29
% 1.21/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.21/1.29
% 1.21/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.21/1.29 % ------ Proving...
% 1.21/1.29 % ------ Problem Properties
% 1.21/1.29
% 1.21/1.29 %
% 1.21/1.29 % clauses 13
% 1.21/1.29 % conjectures 1
% 1.21/1.29 % EPR 1
% 1.21/1.29 % Horn 13
% 1.21/1.29 % unary 8
% 1.21/1.29 % binary 4
% 1.21/1.29 % lits 19
% 1.21/1.29 % lits eq 9
% 1.21/1.29 % fd_pure 0
% 1.21/1.29 % fd_pseudo 0
% 1.21/1.29 % fd_cond 0
% 1.21/1.29 % fd_pseudo_cond 0
% 1.21/1.29 % AC symbols 0
% 1.21/1.29
% 1.21/1.29 % ------ Schedule dynamic 5 is on
% 1.21/1.29
% 1.21/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.21/1.29
% 1.21/1.29
% 1.21/1.29 % ------
% 1.21/1.29 % Current options:
% 1.21/1.29 % ------
% 1.21/1.29
% 1.21/1.29
% 1.21/1.29 %
% 1.21/1.29
% 1.21/1.29 % ------ Proving...
% 1.21/1.29 %
% 1.21/1.29
% 1.21/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.29
% 1.21/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.21/1.29
% 1.21/1.29
%------------------------------------------------------------------------------