%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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 : Sun Jul 17 10:14:17 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 267 ( 0 equ)
% Maximal formula atoms : 64 ( 7 avg)
% Number of connectives : 451 ( 219 ~; 187 |; 45 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 114 ( 1 sgn 49 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(X1)
& p1(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main) ).
fof(c_0_1,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( ~ p8(X1)
& ~ p6(X1)
& ~ p4(X1)
& ~ p2(X1) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p5(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p3(X1)
& ~ p1(X1) )
| ( p1(X1)
& p3(X1) ) ) ) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p4(X1) )
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p2(X1)
& ~ p3(X1) )
| ( p3(X1)
& p2(X1) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ( ~ p1(X1)
& ~ p2(X1) )
| ( p2(X1)
& p1(X1) ) ) ) ) ) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ( p4(X1)
& p3(X1)
& p2(X1)
& p1(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_2,negated_conjecture,
! [X9,X10,X11,X12,X14,X15,X16,X18,X19] :
( r1(esk1_0,esk2_0)
& r1(esk2_0,esk3_0)
& r1(esk3_0,esk4_0)
& r1(esk4_0,esk5_0)
& ( p8(esk5_0)
| p6(esk5_0)
| p4(esk5_0)
| p2(esk5_0) )
& r1(esk1_0,esk6_0)
& ~ p5(esk6_0)
& ( p3(X12)
| p1(X12)
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(X9,X10)
| ~ r1(esk1_0,X9) )
& ( ~ p1(X12)
| ~ p3(X12)
| ~ r1(X11,X12)
| ~ r1(X10,X11)
| ~ r1(X9,X10)
| ~ r1(esk1_0,X9) )
& ( r1(X9,esk7_1(X9))
| ~ r1(esk1_0,X9) )
& ( ~ p4(esk7_1(X9))
| ~ r1(esk1_0,X9) )
& ( p2(X16)
| p3(X16)
| ~ r1(X15,X16)
| ~ r1(X14,X15)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( ~ p3(X16)
| ~ p2(X16)
| ~ r1(X15,X16)
| ~ r1(X14,X15)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( r1(X14,esk8_2(X9,X14))
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( ~ p3(esk8_2(X9,X14))
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( p1(X19)
| p2(X19)
| ~ r1(X18,X19)
| ~ r1(X14,X18)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& ( ~ p2(X19)
| ~ p1(X19)
| ~ r1(X18,X19)
| ~ r1(X14,X18)
| ~ r1(X9,X14)
| ~ r1(esk1_0,X9) )
& r1(esk1_0,esk9_0)
& r1(esk9_0,esk10_0)
& r1(esk10_0,esk11_0)
& r1(esk11_0,esk12_0)
& ( ~ p4(esk12_0)
| ~ p3(esk12_0)
| ~ p2(esk12_0)
| ~ p1(esk12_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)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ p1(X4)
| ~ p2(X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
r1(esk1_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( p1(X4)
| p3(X4)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( p3(X4)
| p2(X4)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk9_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_8,negated_conjecture,
r1(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk9_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk9_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ p2(X4)
| ~ p3(X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4)
| ~ p3(X4)
| ~ p1(X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk10_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
r1(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_15,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk10_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk10_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( p2(X4)
| p1(X4)
| ~ r1(esk1_0,X1)
| ~ r1(X1,X2)
| ~ r1(X2,X3)
| ~ r1(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_18,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk9_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(esk9_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_20,negated_conjecture,
( ~ p1(X1)
| ~ p2(X1)
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( p1(X1)
| p3(X1)
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( p3(X1)
| p2(X1)
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk9_0,X2)
| ~ r1(X3,X1)
| ~ r1(X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_24,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk10_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ p1(X1)
| ~ p3(X1)
| ~ r1(esk10_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_8]) ).
cnf(c_0_26,negated_conjecture,
( p3(X1)
| ~ r1(esk11_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk10_0,X2)
| ~ r1(X2,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( ~ p3(X1)
| ~ p2(X1)
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( ~ p1(X1)
| ~ r1(esk11_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( p1(X1)
| p2(X1)
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_31,negated_conjecture,
( ~ p2(X1)
| ~ r1(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
r1(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_33,negated_conjecture,
~ r1(esk11_0,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL650+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 10:27:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.016 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 35
% 0.23/1.42 # Proof object clause steps : 32
% 0.23/1.42 # Proof object formula steps : 3
% 0.23/1.42 # Proof object conjectures : 35
% 0.23/1.42 # Proof object clause conjectures : 32
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 10
% 0.23/1.42 # Proof object initial formulas used : 1
% 0.23/1.42 # Proof object generating inferences : 21
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 1
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 22
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 22
% 0.23/1.42 # Processed clauses : 144
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 5
% 0.23/1.42 # ...remaining for further processing : 139
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 11
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 286
% 0.23/1.42 # ...of the previous two non-trivial : 251
% 0.23/1.42 # Contextual simplify-reflections : 19
% 0.23/1.42 # Paramodulations : 285
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 127
% 0.23/1.42 # Positive orientable unit clauses : 8
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 2
% 0.23/1.42 # Non-unit-clauses : 117
% 0.23/1.42 # Current number of unprocessed clauses: 116
% 0.23/1.42 # ...number of literals in the above : 615
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 12
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 2753
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 558
% 0.23/1.42 # Non-unit clause-clause subsumptions : 35
% 0.23/1.42 # Unit Clause-clause subsumption calls : 112
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 7339
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.040 s
% 0.23/1.42 # System time : 0.004 s
% 0.23/1.42 # Total time : 0.044 s
% 0.23/1.42 # Maximum resident set size: 3292 pages
%------------------------------------------------------------------------------