%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PRO012+2 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:01:54 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 92 ( 4 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 106 ( 40 ~; 40 |; 21 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% 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 : 39 ( 0 sgn 16 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103] :
( occurrence_of(X102,tptp3)
& root_occ(X102,X101)
& ( occurrence_of(X103,tptp2)
| occurrence_of(X103,tptp1) )
& min_precedes(X102,X103,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96] :
( occurrence_of(X96,tptp0)
=> ? [X97,X98,X99] :
( occurrence_of(X97,tptp3)
& root_occ(X97,X96)
& occurrence_of(X98,tptp4)
& min_precedes(X97,X98,tptp0)
& ( occurrence_of(X99,tptp2)
| occurrence_of(X99,tptp1) )
& min_precedes(X98,X99,tptp0)
& ! [X100] :
( min_precedes(X97,X100,tptp0)
=> ( X100 = X98
| X100 = X99 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X1,X2,X4)
& min_precedes(X2,X3,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(c_0_3,negated_conjecture,
~ ! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103] :
( occurrence_of(X102,tptp3)
& root_occ(X102,X101)
& ( occurrence_of(X103,tptp2)
| occurrence_of(X103,tptp1) )
& min_precedes(X102,X103,tptp0) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,plain,
! [X319,X323] :
( ( occurrence_of(esk15_1(X319),tptp3)
| ~ occurrence_of(X319,tptp0) )
& ( root_occ(esk15_1(X319),X319)
| ~ occurrence_of(X319,tptp0) )
& ( occurrence_of(esk16_1(X319),tptp4)
| ~ occurrence_of(X319,tptp0) )
& ( min_precedes(esk15_1(X319),esk16_1(X319),tptp0)
| ~ occurrence_of(X319,tptp0) )
& ( occurrence_of(esk17_1(X319),tptp2)
| occurrence_of(esk17_1(X319),tptp1)
| ~ occurrence_of(X319,tptp0) )
& ( min_precedes(esk16_1(X319),esk17_1(X319),tptp0)
| ~ occurrence_of(X319,tptp0) )
& ( ~ min_precedes(esk15_1(X319),X323,tptp0)
| X323 = esk16_1(X319)
| X323 = esk17_1(X319)
| ~ occurrence_of(X319,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X325,X326] :
( occurrence_of(esk18_0,tptp0)
& ( ~ occurrence_of(X326,tptp2)
| ~ occurrence_of(X325,tptp3)
| ~ root_occ(X325,esk18_0)
| ~ min_precedes(X325,X326,tptp0) )
& ( ~ occurrence_of(X326,tptp1)
| ~ occurrence_of(X325,tptp3)
| ~ root_occ(X325,esk18_0)
| ~ min_precedes(X325,X326,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( root_occ(esk15_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( occurrence_of(esk15_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X207,X208,X209,X210] :
( ~ min_precedes(X207,X208,X210)
| ~ min_precedes(X208,X209,X210)
| min_precedes(X207,X209,X210) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])]) ).
cnf(c_0_10,plain,
( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ root_occ(X2,esk18_0)
| ~ min_precedes(X2,X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
root_occ(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_14,plain,
( occurrence_of(esk17_1(X1),tptp2)
| occurrence_of(esk17_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ root_occ(X2,esk18_0)
| ~ min_precedes(X2,X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( min_precedes(X1,X4,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X2,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_18,plain,
( min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk15_1(esk18_0),X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
( occurrence_of(esk17_1(esk18_0),tptp1)
| occurrence_of(esk17_1(esk18_0),tptp2) ),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_21,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk15_1(esk18_0),X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13])]) ).
cnf(c_0_22,negated_conjecture,
( min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ min_precedes(X1,esk16_1(esk18_0),tptp0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_24,negated_conjecture,
~ min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PRO012+2 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n003.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 01:30:11 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------