%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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 : 600s
% DateTime : Mon Jul 18 17:45:01 EDT 2022
% Result : Theorem 0.27s 1.44s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 2 unt; 0 def)
% Number of atoms : 100 ( 4 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 131 ( 54 ~; 51 |; 21 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 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 : 45 ( 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).
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,
! [X5,X6,X7,X8] :
( ~ min_precedes(X5,X6,X8)
| ~ min_precedes(X6,X7,X8)
| min_precedes(X5,X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])]) ).
fof(c_0_5,plain,
! [X101,X105] :
( ( occurrence_of(esk2_1(X101),tptp3)
| ~ occurrence_of(X101,tptp0) )
& ( root_occ(esk2_1(X101),X101)
| ~ occurrence_of(X101,tptp0) )
& ( occurrence_of(esk3_1(X101),tptp4)
| ~ occurrence_of(X101,tptp0) )
& ( min_precedes(esk2_1(X101),esk3_1(X101),tptp0)
| ~ occurrence_of(X101,tptp0) )
& ( occurrence_of(esk4_1(X101),tptp2)
| occurrence_of(esk4_1(X101),tptp1)
| ~ occurrence_of(X101,tptp0) )
& ( min_precedes(esk3_1(X101),esk4_1(X101),tptp0)
| ~ occurrence_of(X101,tptp0) )
& ( ~ min_precedes(esk2_1(X101),X105,tptp0)
| X105 = esk3_1(X101)
| X105 = esk4_1(X101)
| ~ occurrence_of(X101,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X105,X106] :
( occurrence_of(esk1_0,tptp0)
& ( ~ occurrence_of(X106,tptp2)
| ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,esk1_0)
| ~ min_precedes(X105,X106,tptp0) )
& ( ~ occurrence_of(X106,tptp1)
| ~ occurrence_of(X105,tptp3)
| ~ root_occ(X105,esk1_0)
| ~ min_precedes(X105,X106,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])]) ).
cnf(c_0_7,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( min_precedes(esk3_1(X1),esk4_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk1_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( min_precedes(X1,esk4_1(X2),tptp0)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(X1,esk3_1(X2),tptp0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk1_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ root_occ(X1,esk1_0)
| ~ occurrence_of(esk4_1(X2),tptp1)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(X1,esk3_1(X2),tptp0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( min_precedes(esk2_1(X1),esk3_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( occurrence_of(esk2_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( ~ root_occ(X1,esk1_0)
| ~ occurrence_of(esk4_1(X2),tptp2)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(X1,esk3_1(X2),tptp0) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ root_occ(esk2_1(X1),esk1_0)
| ~ occurrence_of(esk4_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
( occurrence_of(esk4_1(X1),tptp1)
| occurrence_of(esk4_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ root_occ(esk2_1(X1),esk1_0)
| ~ occurrence_of(esk4_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( ~ root_occ(esk2_1(X1),esk1_0)
| ~ occurrence_of(X1,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
( root_occ(esk2_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 03:20:48 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.27/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.44 # Preprocessing time : 0.019 s
% 0.27/1.44
% 0.27/1.44 # Proof found!
% 0.27/1.44 # SZS status Theorem
% 0.27/1.44 # SZS output start CNFRefutation
% See solution above
% 0.27/1.44 # Proof object total steps : 23
% 0.27/1.44 # Proof object clause steps : 16
% 0.27/1.44 # Proof object formula steps : 7
% 0.27/1.44 # Proof object conjectures : 12
% 0.27/1.44 # Proof object clause conjectures : 9
% 0.27/1.44 # Proof object formula conjectures : 3
% 0.27/1.44 # Proof object initial clauses used : 9
% 0.27/1.44 # Proof object initial formulas used : 3
% 0.27/1.44 # Proof object generating inferences : 7
% 0.27/1.44 # Proof object simplifying inferences : 5
% 0.27/1.44 # Training examples: 0 positive, 0 negative
% 0.27/1.44 # Parsed axioms : 46
% 0.27/1.44 # Removed by relevancy pruning/SinE : 16
% 0.27/1.44 # Initial clauses : 54
% 0.27/1.44 # Removed in clause preprocessing : 0
% 0.27/1.44 # Initial clauses in saturation : 54
% 0.27/1.44 # Processed clauses : 832
% 0.27/1.44 # ...of these trivial : 2
% 0.27/1.44 # ...subsumed : 514
% 0.27/1.44 # ...remaining for further processing : 316
% 0.27/1.44 # Other redundant clauses eliminated : 0
% 0.27/1.44 # Clauses deleted for lack of memory : 0
% 0.27/1.44 # Backward-subsumed : 41
% 0.27/1.44 # Backward-rewritten : 18
% 0.27/1.44 # Generated clauses : 1521
% 0.27/1.44 # ...of the previous two non-trivial : 1312
% 0.27/1.44 # Contextual simplify-reflections : 498
% 0.27/1.44 # Paramodulations : 1521
% 0.27/1.44 # Factorizations : 0
% 0.27/1.44 # Equation resolutions : 0
% 0.27/1.44 # Current number of processed clauses : 257
% 0.27/1.44 # Positive orientable unit clauses : 15
% 0.27/1.44 # Positive unorientable unit clauses: 0
% 0.27/1.44 # Negative unit clauses : 16
% 0.27/1.44 # Non-unit-clauses : 226
% 0.27/1.44 # Current number of unprocessed clauses: 401
% 0.27/1.44 # ...number of literals in the above : 1504
% 0.27/1.44 # Current number of archived formulas : 0
% 0.27/1.44 # Current number of archived clauses : 59
% 0.27/1.44 # Clause-clause subsumption calls (NU) : 44703
% 0.27/1.44 # Rec. Clause-clause subsumption calls : 31094
% 0.27/1.44 # Non-unit clause-clause subsumptions : 957
% 0.27/1.44 # Unit Clause-clause subsumption calls : 360
% 0.27/1.44 # Rewrite failures with RHS unbound : 0
% 0.27/1.44 # BW rewrite match attempts : 4
% 0.27/1.44 # BW rewrite match successes : 4
% 0.27/1.44 # Condensation attempts : 0
% 0.27/1.44 # Condensation successes : 0
% 0.27/1.44 # Termbank termtop insertions : 21239
% 0.27/1.44
% 0.27/1.44 # -------------------------------------------------
% 0.27/1.44 # User time : 0.082 s
% 0.27/1.44 # System time : 0.006 s
% 0.27/1.44 # Total time : 0.088 s
% 0.27/1.44 # Maximum resident set size: 3896 pages
%------------------------------------------------------------------------------