TSTP Solution File: LCL656+1.001 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:55 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 6 unt; 0 def)
% Number of atoms : 160 ( 0 equ)
% Maximal formula atoms : 66 ( 12 avg)
% Number of connectives : 271 ( 124 ~; 103 |; 44 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 0 sgn 24 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ( ( ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ p2(X1)
& ~ p102(X1)
& p101(X1) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( p2(X1)
& ~ p102(X1)
& p101(X1) ) ) )
| ~ ( ~ p101(X2)
& p100(X2) ) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p2(X1)
| ~ p101(X1) )
| p2(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p2(X1)
| ~ p101(X1) )
| ~ p2(X2) ) )
| ~ p101(X2) )
& ( ( ( ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1)
| ~ p100(X1) )
| p1(X2) )
& ( ! [X1] :
( ~ r1(X2,X1)
| p1(X1)
| ~ p100(X1) )
| ~ p1(X2) ) )
| ~ p100(X2) )
& ( p101(X2)
| ~ p102(X2) )
& ( p100(X2)
| ~ p101(X2) ) ) )
& ~ p101(X1)
& p100(X1) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_3,negated_conjecture,
! [X4,X5,X8,X9,X10,X11] :
( ( ~ r1(esk1_0,X4)
| p2(X4) )
& ( r1(X5,esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p2(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk2_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( r1(X5,esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p2(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ p102(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(esk3_1(X5))
| p101(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X8)
| ~ p2(X8)
| ~ p101(X8)
| p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X9)
| p2(X9)
| ~ p101(X9)
| ~ p2(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X10)
| ~ p1(X10)
| ~ p100(X10)
| p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( ~ r1(X5,X11)
| p1(X11)
| ~ p100(X11)
| ~ p1(X5)
| ~ p100(X5)
| ~ r1(esk1_0,X5) )
& ( p101(X5)
| ~ p102(X5)
| ~ r1(esk1_0,X5) )
& ( p100(X5)
| ~ p101(X5)
| ~ r1(esk1_0,X5) )
& ~ p101(esk1_0)
& p100(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)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( p101(X1)
| ~ r1(esk1_0,X1)
| ~ p100(X1)
| ~ p2(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( p2(X1)
| ~ r1(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_7,negated_conjecture,
( p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,esk2_1(X1))
| ~ r1(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( p101(X1)
| r1(X1,esk2_1(X1))
| ~ r1(esk1_0,X1)
| ~ p100(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
p100(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ p101(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 3 07:06:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41 # Preprocessing time : 0.015 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 13
% 0.21/1.41 # Proof object clause steps : 8
% 0.21/1.41 # Proof object formula steps : 5
% 0.21/1.41 # Proof object conjectures : 10
% 0.21/1.41 # Proof object clause conjectures : 7
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 6
% 0.21/1.41 # Proof object initial formulas used : 2
% 0.21/1.41 # Proof object generating inferences : 2
% 0.21/1.41 # Proof object simplifying inferences : 4
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 2
% 0.21/1.41 # Removed by relevancy pruning/SinE : 0
% 0.21/1.41 # Initial clauses : 18
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 18
% 0.21/1.41 # Processed clauses : 20
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 2
% 0.21/1.41 # ...remaining for further processing : 18
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 0
% 0.21/1.41 # Backward-rewritten : 0
% 0.21/1.41 # Generated clauses : 11
% 0.21/1.41 # ...of the previous two non-trivial : 6
% 0.21/1.41 # Contextual simplify-reflections : 6
% 0.21/1.41 # Paramodulations : 11
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 18
% 0.21/1.41 # Positive orientable unit clauses : 2
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 1
% 0.21/1.41 # Non-unit-clauses : 15
% 0.21/1.41 # Current number of unprocessed clauses: 4
% 0.21/1.41 # ...number of literals in the above : 24
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 0
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 50
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 37
% 0.21/1.41 # Non-unit clause-clause subsumptions : 8
% 0.21/1.41 # Unit Clause-clause subsumption calls : 0
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 0
% 0.21/1.41 # BW rewrite match successes : 0
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 1596
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.015 s
% 0.21/1.41 # System time : 0.002 s
% 0.21/1.41 # Total time : 0.017 s
% 0.21/1.41 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------