TSTP Solution File: LCL686+1.001 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL686+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:16:58 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 27 ( 6 avg)
% Number of connectives : 160 ( 78 ~; 62 |; 20 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 34 ( 0 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X1] :
~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ p3(X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ( ! [X2] :
( ~ r1(X1,X2)
| ~ $true )
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ( p2(X2)
& ~ p1(X2) )
| ( ~ p2(X2)
& p1(X2) ) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p3(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ( ~ p1(X2)
& ~ p2(X2) )
| ( p2(X2)
& p1(X2) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_3,negated_conjecture,
! [X7,X9] :
( r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0)
& r1(esk1_0,esk4_0)
& ( r1(X7,esk5_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p2(X9)
| p1(X9)
| ~ r1(X7,X9)
| ~ r1(esk4_0,X7) )
& ( p2(X9)
| ~ p1(X9)
| ~ r1(X7,X9)
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk6_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p3(esk6_1(X7))
| ~ r1(esk4_0,X7) )
& ( r1(X7,esk7_1(X7))
| ~ r1(esk4_0,X7) )
& ( p1(esk7_1(X7))
| p2(esk7_1(X7))
| ~ r1(esk4_0,X7) )
& ( ~ p2(esk7_1(X7))
| ~ p1(esk7_1(X7))
| ~ r1(esk4_0,X7) ) ),
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])])])])])])])]) ).
fof(c_0_4,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_5,negated_conjecture,
( p2(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( p1(X2)
| ~ r1(esk4_0,X1)
| ~ r1(X1,X2)
| ~ p2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ r1(esk4_0,X1)
| ~ p1(esk7_1(X1))
| ~ p2(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( p2(esk7_1(X1))
| p1(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ p1(esk7_1(X1))
| ~ r1(esk4_0,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ r1(esk4_0,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL686+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n011.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 : Tue Jul 5 00:11:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.42 # Preprocessing time : 0.014 s
% 0.22/1.42
% 0.22/1.42 # Proof found!
% 0.22/1.42 # SZS status Theorem
% 0.22/1.42 # SZS output start CNFRefutation
% See solution above
% 0.22/1.42 # Proof object total steps : 16
% 0.22/1.42 # Proof object clause steps : 11
% 0.22/1.42 # Proof object formula steps : 5
% 0.22/1.42 # Proof object conjectures : 13
% 0.22/1.42 # Proof object clause conjectures : 10
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 6
% 0.22/1.42 # Proof object initial formulas used : 2
% 0.22/1.42 # Proof object generating inferences : 5
% 0.22/1.42 # Proof object simplifying inferences : 3
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 3
% 0.22/1.42 # Removed by relevancy pruning/SinE : 0
% 0.22/1.42 # Initial clauses : 15
% 0.22/1.42 # Removed in clause preprocessing : 0
% 0.22/1.42 # Initial clauses in saturation : 15
% 0.22/1.42 # Processed clauses : 33
% 0.22/1.42 # ...of these trivial : 0
% 0.22/1.42 # ...subsumed : 3
% 0.22/1.42 # ...remaining for further processing : 30
% 0.22/1.42 # Other redundant clauses eliminated : 0
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 1
% 0.22/1.42 # Backward-rewritten : 0
% 0.22/1.42 # Generated clauses : 50
% 0.22/1.42 # ...of the previous two non-trivial : 36
% 0.22/1.42 # Contextual simplify-reflections : 3
% 0.22/1.42 # Paramodulations : 50
% 0.22/1.42 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 0
% 0.22/1.42 # Current number of processed clauses : 29
% 0.22/1.42 # Positive orientable unit clauses : 7
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 0
% 0.22/1.42 # Non-unit-clauses : 22
% 0.22/1.42 # Current number of unprocessed clauses: 18
% 0.22/1.42 # ...number of literals in the above : 60
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 1
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 90
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 69
% 0.22/1.42 # Non-unit clause-clause subsumptions : 7
% 0.22/1.42 # Unit Clause-clause subsumption calls : 0
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 0
% 0.22/1.42 # BW rewrite match successes : 0
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 1558
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.013 s
% 0.22/1.42 # System time : 0.003 s
% 0.22/1.42 # Total time : 0.016 s
% 0.22/1.42 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------