%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : PRO012+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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 02:31:36 PM UTC 2026
% Result : Theorem 1.80s 1.18s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 39 ( 5 unt; 0 def)
% Number of atoms : 149 ( 8 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 183 ( 73 ~; 70 |; 35 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 2 ( 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 : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 76 ( 0 sgn 62 !; 14 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(f33,axiom,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( ! [X4] :
( min_precedes(X1,X4,tptp0)
=> ( X4 = X3
| X4 = X2 ) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f46,conjecture,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( min_precedes(X1,X2,tptp0)
& ( occurrence_of(X2,tptp1)
| occurrence_of(X2,tptp2) )
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( min_precedes(X1,X2,tptp0)
& ( occurrence_of(X2,tptp1)
| occurrence_of(X2,tptp2) )
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f51,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3) ),
inference(flattening,[],[f50]) ).
fof(f92,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ min_precedes(X1,X4,tptp0)
| X4 = X3
| X4 = X2 )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f93,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ? [X1,X2,X3] :
( ! [X4] :
( ~ min_precedes(X1,X4,tptp0)
| X4 = X3
| X4 = X2 )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(flattening,[],[f92]) ).
fof(f94,plain,
? [X0] :
( occurrence_of(X0,tptp0)
& ! [X1,X2] :
( ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,X0)
| ~ occurrence_of(X1,tptp3) ) ),
inference(ennf_transformation,[],[f47]) ).
fof(f117,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ( ! [X4] :
( ~ min_precedes(sK14(X0),X4,tptp0)
| sK16(X0) = X4
| sK15(X0) = X4 )
& min_precedes(sK15(X0),sK16(X0),tptp0)
& ( occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2) )
& min_precedes(sK14(X0),sK15(X0),tptp0)
& occurrence_of(sK15(X0),tptp4)
& root_occ(sK14(X0),X0)
& occurrence_of(sK14(X0),tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0))],[f93]) ).
fof(f118,plain,
( occurrence_of(sK17,tptp0)
& ! [X1,X2] :
( ~ min_precedes(X1,X2,tptp0)
| ( ~ occurrence_of(X2,tptp1)
& ~ occurrence_of(X2,tptp2) )
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X0,sK17)],[f94]) ).
fof(f119,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3)
| min_precedes(X0,X2,X3) ),
inference(cnf_transformation,[],[f51]) ).
fof(f180,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK15(X0),sK16(X0),tptp0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f181,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2) ),
inference(cnf_transformation,[],[f117]) ).
fof(f182,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sK14(X0),sK15(X0),tptp0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f184,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| root_occ(sK14(X0),X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f185,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sK14(X0),tptp3) ),
inference(cnf_transformation,[],[f117]) ).
fof(f198,plain,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f118]) ).
fof(f199,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ occurrence_of(X2,tptp1)
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f118]) ).
fof(f200,plain,
! [X2,X1] :
( ~ min_precedes(X1,X2,tptp0)
| ~ occurrence_of(X2,tptp2)
| ~ root_occ(X1,sK17)
| ~ occurrence_of(X1,tptp3) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( min_precedes(X0,X3,X2)
| ~ min_precedes(X1,X3,X2)
| ~ min_precedes(X0,X1,X2) ),
inference(cnf_transformation,[],[f119]) ).
tcf(c_109,plain,
! [X0: $i] :
( occurrence_of(sK14(X0),tptp3)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_110,plain,
! [X0: $i] :
( root_occ(sK14(X0),X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_112,plain,
! [X0: $i] :
( min_precedes(sK14(X0),sK15(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f182]) ).
tcf(c_113,plain,
! [X0: $i] :
( occurrence_of(sK16(X0),tptp1)
| occurrence_of(sK16(X0),tptp2)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_114,plain,
! [X0: $i] :
( min_precedes(sK15(X0),sK16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f180]) ).
tcf(c_128,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ root_occ(X0,sK17)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_129,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ root_occ(X0,sK17)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_130,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(cnf_transformation,[],[f198]) ).
tcf(c_5184,negated_conjecture,
occurrence_of(sK17,tptp0),
inference(demodulation,[status(thm)],[c_130]) ).
tcf(c_5185,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ root_occ(X0,sK17)
| ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_5186,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ root_occ(X0,sK17)
| ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X0,tptp3)
| ~ min_precedes(X0,X1,tptp0) ),
inference(demodulation,[status(thm)],[c_128]) ).
tcf(c_6579,plain,
! [X0: $i,X1: $i] :
( min_precedes(sK14(X0),X1,tptp0)
| ~ occurrence_of(X0,tptp0)
| ~ min_precedes(sK15(X0),X1,tptp0) ),
inference(superposition,[status(thm)],[c_112,c_49]) ).
tcf(c_6724,plain,
! [X0: $i] :
( min_precedes(sK14(X0),sK16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(superposition,[status(thm)],[c_114,c_6579]) ).
tcf(c_7165,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sK14(X0),sK17)
| ~ occurrence_of(sK16(X0),tptp2)
| ~ occurrence_of(sK14(X0),tptp3) ),
inference(superposition,[status(thm)],[c_6724,c_5186]) ).
tcf(c_7166,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sK14(X0),sK17)
| ~ occurrence_of(sK16(X0),tptp1)
| ~ occurrence_of(sK14(X0),tptp3) ),
inference(superposition,[status(thm)],[c_6724,c_5185]) ).
tcf(c_7257,plain,
! [X0: $i] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sK14(X0),sK17) ),
inference(global_subsumption_just,[status(thm)],[c_7165,c_109,c_113,c_7166,c_7165]) ).
tcf(c_7264,plain,
~ occurrence_of(sK17,tptp0),
inference(superposition,[status(thm)],[c_110,c_7257]) ).
tcf(c_7265,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7264,c_5184]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO012+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 06:34:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.80/1.18 % SZS status Started for theBenchmark.p
% 1.80/1.18 % SZS status Theorem for theBenchmark.p
% 1.80/1.18
% 1.80/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.18
% 1.80/1.18 % ------ iProver source info
% 1.80/1.18
% 1.80/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.18 % git: non_committed_changes: false
% 1.80/1.18
% 1.80/1.18 % ------ Parsing...
% 1.80/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.80/1.18
% 1.80/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.80/1.18
% 1.80/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.80/1.18
% 1.80/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.80/1.18 % ------ Proving...
% 1.80/1.18 % ------ Problem Properties
% 1.80/1.18
% 1.80/1.18 %
% 1.80/1.18 % clauses 80
% 1.80/1.18 % conjectures 3
% 1.80/1.18 % EPR 44
% 1.80/1.18 % Horn 65
% 1.80/1.18 % unary 13
% 1.80/1.18 % binary 38
% 1.80/1.18 % lits 190
% 1.80/1.18 % lits eq 12
% 1.80/1.18 % fd_pure 0
% 1.80/1.18 % fd_pseudo 0
% 1.80/1.18 % fd_cond 0
% 1.80/1.18 % fd_pseudo_cond 5
% 1.80/1.18 % AC symbols 0
% 1.80/1.18
% 1.80/1.18 % ------ Schedule dynamic 5 is on
% 1.80/1.18
% 1.80/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.80/1.18
% 1.80/1.18
% 1.80/1.18 % ------
% 1.80/1.18 % Current options:
% 1.80/1.18 % ------
% 1.80/1.18
% 1.80/1.18
% 1.80/1.18 %
% 1.80/1.18
% 1.80/1.18 % ------ Proving...
% 1.80/1.18 %
% 1.80/1.18
% 1.80/1.18 % SZS status Theorem for theBenchmark.p
% 1.80/1.18
% 1.80/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.18
%------------------------------------------------------------------------------