%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PRO010+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n013.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:53 PM UTC 2026
% Result : Theorem 1.28s 1.73s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 142 ( 8 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 158 ( 50 ~; 59 |; 39 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 62 ( 3 sgn 27 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& min_precedes(X111,X114,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& occurrence_of(X108,tptp4)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& next_subocc(X108,X109,tptp0)
& leaf_occ(X109,X106) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_47,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_47) ).
fof(c_0_6,negated_conjecture,
~ ! [X110] :
( occurrence_of(X110,tptp0)
=> ? [X111,X112] :
( leaf_occ(X112,X110)
& ( occurrence_of(X112,tptp1)
=> ~ ? [X113] :
( occurrence_of(X113,tptp2)
& min_precedes(X111,X113,tptp0) ) )
& ( occurrence_of(X112,tptp2)
=> ~ ? [X114] :
( occurrence_of(X114,tptp1)
& min_precedes(X111,X114,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X351] :
( ( occurrence_of(esk16_1(X351),tptp3)
| ~ occurrence_of(X351,tptp0) )
& ( root_occ(esk16_1(X351),X351)
| ~ occurrence_of(X351,tptp0) )
& ( occurrence_of(esk17_1(X351),tptp4)
| ~ occurrence_of(X351,tptp0) )
& ( next_subocc(esk16_1(X351),esk17_1(X351),tptp0)
| ~ occurrence_of(X351,tptp0) )
& ( occurrence_of(esk18_1(X351),tptp1)
| occurrence_of(esk18_1(X351),tptp2)
| ~ occurrence_of(X351,tptp0) )
& ( next_subocc(esk17_1(X351),esk18_1(X351),tptp0)
| ~ occurrence_of(X351,tptp0) )
& ( leaf_occ(esk18_1(X351),X351)
| ~ occurrence_of(X351,tptp0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])]) ).
fof(c_0_8,negated_conjecture,
! [X356,X357] :
( occurrence_of(esk19_0,tptp0)
& ( occurrence_of(X357,tptp2)
| occurrence_of(X357,tptp1)
| ~ leaf_occ(X357,esk19_0) )
& ( occurrence_of(esk21_2(X356,X357),tptp1)
| occurrence_of(X357,tptp1)
| ~ leaf_occ(X357,esk19_0) )
& ( min_precedes(X356,esk21_2(X356,X357),tptp0)
| occurrence_of(X357,tptp1)
| ~ leaf_occ(X357,esk19_0) )
& ( occurrence_of(X357,tptp2)
| occurrence_of(esk20_2(X356,X357),tptp2)
| ~ leaf_occ(X357,esk19_0) )
& ( occurrence_of(esk21_2(X356,X357),tptp1)
| occurrence_of(esk20_2(X356,X357),tptp2)
| ~ leaf_occ(X357,esk19_0) )
& ( min_precedes(X356,esk21_2(X356,X357),tptp0)
| occurrence_of(esk20_2(X356,X357),tptp2)
| ~ leaf_occ(X357,esk19_0) )
& ( occurrence_of(X357,tptp2)
| min_precedes(X356,esk20_2(X356,X357),tptp0)
| ~ leaf_occ(X357,esk19_0) )
& ( occurrence_of(esk21_2(X356,X357),tptp1)
| min_precedes(X356,esk20_2(X356,X357),tptp0)
| ~ leaf_occ(X357,esk19_0) )
& ( min_precedes(X356,esk21_2(X356,X357),tptp0)
| min_precedes(X356,esk20_2(X356,X357),tptp0)
| ~ leaf_occ(X357,esk19_0) ) ),
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_6])])])])]) ).
fof(c_0_9,plain,
! [X233,X234,X235] :
( ~ occurrence_of(X233,X234)
| ~ occurrence_of(X233,X235)
| X234 = X235 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_10,plain,
! [X345,X346,X348,X349,X350] :
( ( occurrence_of(X346,esk15_2(X345,X346))
| ~ leaf_occ(X345,X346) )
& ( subactivity_occurrence(X345,X346)
| ~ leaf_occ(X345,X346) )
& ( leaf(X345,esk15_2(X345,X346))
| ~ leaf_occ(X345,X346) )
& ( ~ occurrence_of(X349,X350)
| ~ subactivity_occurrence(X348,X349)
| ~ leaf(X348,X350)
| leaf_occ(X348,X349) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_34])])])])])]) ).
cnf(c_0_11,plain,
( leaf_occ(esk18_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
leaf_occ(esk18_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X285,X286,X288,X289,X290,X291] :
( ( root(X285,X286)
| min_precedes(esk6_2(X285,X286),X285,X286)
| ~ leaf(X285,X286) )
& ( ~ min_precedes(X285,X288,X286)
| ~ leaf(X285,X286) )
& ( ~ root(X289,X290)
| min_precedes(X289,esk7_2(X289,X290),X290)
| leaf(X289,X290) )
& ( ~ min_precedes(X291,X289,X290)
| min_precedes(X289,esk7_2(X289,X290),X290)
| leaf(X289,X290) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])])]) ).
cnf(c_0_17,negated_conjecture,
( min_precedes(X1,esk21_2(X1,X2),tptp0)
| occurrence_of(X2,tptp1)
| ~ leaf_occ(X2,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk19_0,esk15_2(esk18_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( min_precedes(X1,esk21_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_22,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
esk15_2(esk18_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( occurrence_of(X1,tptp2)
| min_precedes(X2,esk20_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
leaf(esk18_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( min_precedes(X1,esk20_2(X1,esk18_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| ~ leaf(X1,tptp0) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( X1 = tptp1
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp2),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_32,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[sos_47]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PRO010+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n013.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 01:30:26 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.28/1.73 % Version : CSE_E---1.7
% 1.28/1.73 % Problem : theBenchmark.p
% 1.28/1.73 % SZS status Theorem for theBenchmark.p
% 1.28/1.73 % SZS output start CNFRefutation
% See solution above
% 1.28/1.73 % Total time : 1.370s
%------------------------------------------------------------------------------