%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO010+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:00 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 111 ( 36 ~; 37 |; 30 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 5 sgn 13 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( leaf_occ(X168,X166)
& ( occurrence_of(X168,tptp1)
=> ~ ? [X169] :
( occurrence_of(X169,tptp2)
& min_precedes(X167,X169,tptp0) ) )
& ( occurrence_of(X168,tptp2)
=> ~ ? [X170] :
( occurrence_of(X170,tptp1)
& min_precedes(X167,X170,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(sos_37,axiom,
! [X114,X115,X116] :
( ( occurrence_of(X114,X116)
& leaf_occ(X115,X114) )
=> ~ ? [X117] : min_precedes(X115,X117,X116) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_37) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( occurrence_of(X163,tptp3)
& root_occ(X163,X162)
& occurrence_of(X164,tptp4)
& next_subocc(X163,X164,tptp0)
& ( occurrence_of(X165,tptp1)
| occurrence_of(X165,tptp2) )
& next_subocc(X164,X165,tptp0)
& leaf_occ(X165,X162) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_49) ).
fof(c_0_3,negated_conjecture,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( leaf_occ(X168,X166)
& ( occurrence_of(X168,tptp1)
=> ~ ? [X169] :
( occurrence_of(X169,tptp2)
& min_precedes(X167,X169,tptp0) ) )
& ( occurrence_of(X168,tptp2)
=> ~ ? [X170] :
( occurrence_of(X170,tptp1)
& min_precedes(X167,X170,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,plain,
! [X118,X119,X120,X121] :
( ~ occurrence_of(X118,X120)
| ~ leaf_occ(X119,X118)
| ~ min_precedes(X119,X121,X120) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X172,X173] :
( occurrence_of(esk1_0,tptp0)
& ( occurrence_of(X173,tptp2)
| occurrence_of(X173,tptp1)
| ~ leaf_occ(X173,esk1_0) )
& ( occurrence_of(esk3_2(X172,X173),tptp1)
| occurrence_of(X173,tptp1)
| ~ leaf_occ(X173,esk1_0) )
& ( min_precedes(X172,esk3_2(X172,X173),tptp0)
| occurrence_of(X173,tptp1)
| ~ leaf_occ(X173,esk1_0) )
& ( occurrence_of(X173,tptp2)
| occurrence_of(esk2_2(X172,X173),tptp2)
| ~ leaf_occ(X173,esk1_0) )
& ( occurrence_of(esk3_2(X172,X173),tptp1)
| occurrence_of(esk2_2(X172,X173),tptp2)
| ~ leaf_occ(X173,esk1_0) )
& ( min_precedes(X172,esk3_2(X172,X173),tptp0)
| occurrence_of(esk2_2(X172,X173),tptp2)
| ~ leaf_occ(X173,esk1_0) )
& ( occurrence_of(X173,tptp2)
| min_precedes(X172,esk2_2(X172,X173),tptp0)
| ~ leaf_occ(X173,esk1_0) )
& ( occurrence_of(esk3_2(X172,X173),tptp1)
| min_precedes(X172,esk2_2(X172,X173),tptp0)
| ~ leaf_occ(X173,esk1_0) )
& ( min_precedes(X172,esk3_2(X172,X173),tptp0)
| min_precedes(X172,esk2_2(X172,X173),tptp0)
| ~ leaf_occ(X173,esk1_0) ) ),
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_6,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf_occ(X1,X4)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( min_precedes(X2,esk2_2(X2,X1),tptp0)
| min_precedes(X2,esk3_2(X2,X1),tptp0)
| ~ leaf_occ(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X166] :
( ( occurrence_of(esk5_1(X166),tptp3)
| ~ occurrence_of(X166,tptp0) )
& ( root_occ(esk5_1(X166),X166)
| ~ occurrence_of(X166,tptp0) )
& ( occurrence_of(esk6_1(X166),tptp4)
| ~ occurrence_of(X166,tptp0) )
& ( next_subocc(esk5_1(X166),esk6_1(X166),tptp0)
| ~ occurrence_of(X166,tptp0) )
& ( occurrence_of(esk7_1(X166),tptp1)
| occurrence_of(esk7_1(X166),tptp2)
| ~ occurrence_of(X166,tptp0) )
& ( next_subocc(esk6_1(X166),esk7_1(X166),tptp0)
| ~ occurrence_of(X166,tptp0) )
& ( leaf_occ(esk7_1(X166),X166)
| ~ occurrence_of(X166,tptp0) ) ),
inference(distribute,[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_49])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| ~ leaf_occ(X2,X3)
| ~ occurrence_of(X3,tptp0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_10,plain,
( leaf_occ(esk7_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_13,negated_conjecture,
~ occurrence_of(X1,tptp0),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PRO010+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 02:55:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.021 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 15
% 0.21/1.40 # Proof object clause steps : 8
% 0.21/1.40 # Proof object formula steps : 7
% 0.21/1.40 # Proof object conjectures : 9
% 0.21/1.40 # Proof object clause conjectures : 6
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 4
% 0.21/1.40 # Proof object initial formulas used : 3
% 0.21/1.40 # Proof object generating inferences : 3
% 0.21/1.40 # Proof object simplifying inferences : 4
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 63
% 0.21/1.40 # Removed by relevancy pruning/SinE : 12
% 0.21/1.40 # Initial clauses : 85
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 85
% 0.21/1.40 # Processed clauses : 114
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 3
% 0.21/1.40 # ...remaining for further processing : 111
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 4
% 0.21/1.40 # Backward-rewritten : 6
% 0.21/1.40 # Generated clauses : 203
% 0.21/1.40 # ...of the previous two non-trivial : 184
% 0.21/1.40 # Contextual simplify-reflections : 4
% 0.21/1.40 # Paramodulations : 202
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 100
% 0.21/1.40 # Positive orientable unit clauses : 12
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 9
% 0.21/1.40 # Non-unit-clauses : 79
% 0.21/1.40 # Current number of unprocessed clauses: 146
% 0.21/1.40 # ...number of literals in the above : 587
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 11
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 1911
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 959
% 0.21/1.40 # Non-unit clause-clause subsumptions : 9
% 0.21/1.40 # Unit Clause-clause subsumption calls : 180
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 4
% 0.21/1.40 # BW rewrite match successes : 4
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 7854
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.029 s
% 0.21/1.40 # System time : 0.005 s
% 0.21/1.40 # Total time : 0.034 s
% 0.21/1.40 # Maximum resident set size: 3572 pages
%------------------------------------------------------------------------------