TSTP Solution File: LCL672+1.001 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL672+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:16:28 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 274 ( 0 equ)
% Maximal formula atoms : 90 ( 9 avg)
% Number of connectives : 467 ( 222 ~; 204 |; 40 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 39 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 130 ( 0 sgn 88 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
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(transitivity,axiom,
! [X1,X2,X3] :
( ( r1(X1,X2)
& r1(X2,X3) )
=> r1(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',transitivity) ).
fof(c_0_3,negated_conjecture,
~ ~ ? [X1] :
~ ( ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ p1(X2) ) )
& p1(X2) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ( ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ( ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) ) )
& ~ ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ) ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ( ~ ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| ~ ! [X1] :
( ~ r1(X2,X1)
| ~ $true ) )
& ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p2(X2) )
| ! [X2] :
( ~ r1(X1,X2)
| ! [X1] :
( ~ r1(X2,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) )
| ! [X1] :
( ~ r1(X2,X1)
| p1(X1) ) )
| ! [X2] :
( ~ r1(X1,X2)
| p1(X2) ) ),
inference(assume_negation,[status(cth)],[main]) ).
fof(c_0_4,negated_conjecture,
! [X4,X5,X6,X8,X9,X10,X11,X12,X14,X15,X16,X17,X18,X20,X21,X23,X24,X25,X27,X31] :
( ( r1(X6,esk2_2(X5,X6))
| ~ r1(X5,X6)
| ~ p1(X5)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X4)
| p2(X4)
| ~ r1(esk1_0,X8)
| p1(X8) )
& ( p1(esk2_2(X5,X6))
| ~ r1(X5,X6)
| ~ p1(X5)
| ~ r1(esk1_0,X5)
| ~ r1(esk1_0,X4)
| p2(X4)
| ~ r1(esk1_0,X8)
| p1(X8) )
& ( r1(X12,esk3_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X11,X14)
| p1(X14)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10)
| ~ r1(esk1_0,X9)
| p2(X9)
| ~ r1(esk1_0,X15)
| p1(X15) )
& ( ~ p1(esk3_3(X10,X11,X12))
| ~ r1(X11,X12)
| ~ r1(X11,X14)
| p1(X14)
| ~ r1(X10,X11)
| ~ r1(esk1_0,X10)
| ~ r1(esk1_0,X9)
| p2(X9)
| ~ r1(esk1_0,X15)
| p1(X15) )
& ( r1(X21,esk5_2(X17,X21))
| ~ r1(X17,X21)
| r1(X18,esk4_2(X17,X18))
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X16)
| p2(X16)
| ~ r1(esk1_0,X23)
| p1(X23) )
& ( ~ p1(esk5_2(X17,X21))
| ~ r1(X17,X21)
| r1(X18,esk4_2(X17,X18))
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X16)
| p2(X16)
| ~ r1(esk1_0,X23)
| p1(X23) )
& ( r1(X21,esk5_2(X17,X21))
| ~ r1(X17,X21)
| ~ r1(esk4_2(X17,X18),X20)
| p1(X20)
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X16)
| p2(X16)
| ~ r1(esk1_0,X23)
| p1(X23) )
& ( ~ p1(esk5_2(X17,X21))
| ~ r1(X17,X21)
| ~ r1(esk4_2(X17,X18),X20)
| p1(X20)
| ~ r1(X17,X18)
| ~ r1(esk1_0,X17)
| ~ r1(esk1_0,X16)
| p2(X16)
| ~ r1(esk1_0,X23)
| p1(X23) )
& ( ~ r1(esk1_0,X24)
| p2(X24)
| ~ r1(esk1_0,X25)
| r1(X25,esk6_1(X25))
| ~ r1(esk1_0,X27)
| p1(X27) )
& r1(esk1_0,esk7_0)
& ~ p2(esk7_0)
& r1(esk1_0,esk8_0)
& r1(esk8_0,esk9_0)
& ( ~ r1(esk9_0,X31)
| p1(X31) )
& r1(esk8_0,esk10_0)
& ~ p1(esk10_0)
& r1(esk1_0,esk11_0)
& ~ p1(esk11_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_3])])])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( p1(X1)
| p2(X2)
| p1(X5)
| r1(X6,esk3_3(X3,X4,X6))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5)
| ~ r1(X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
r1(esk1_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ p1(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X2] : r1(X2,X2),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_9,negated_conjecture,
( p1(X1)
| p2(X2)
| r1(X3,esk3_3(X4,esk1_0,X3))
| ~ r1(esk1_0,X4)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X3)
| ~ r1(X4,esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ r1(X4,X5)
| ~ r1(X5,X6)
| r1(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity])]) ).
cnf(c_0_12,negated_conjecture,
( p1(X1)
| p2(X2)
| r1(X3,esk3_3(esk1_0,esk1_0,X3))
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
r1(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
~ p2(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( r1(X1,X2)
| ~ r1(X3,X2)
| ~ r1(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
r1(esk8_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( p1(X1)
| p2(X2)
| p1(X5)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X3)
| ~ r1(X3,X4)
| ~ r1(X4,X5)
| ~ r1(X4,X6)
| ~ p1(esk3_3(X3,X4,X6)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( p1(X1)
| ~ r1(esk9_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( p1(X1)
| r1(X2,esk3_3(esk1_0,esk1_0,X2))
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( r1(X1,esk9_0)
| ~ r1(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
r1(esk1_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( p1(X1)
| p1(X2)
| p2(X3)
| ~ r1(esk9_0,esk3_3(X4,X5,X6))
| ~ r1(esk1_0,X4)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X2)
| ~ r1(X5,X6)
| ~ r1(X5,X1)
| ~ r1(X4,X5) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( r1(X1,esk3_3(esk1_0,esk1_0,X1))
| ~ r1(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_6]),c_0_7]) ).
cnf(c_0_24,negated_conjecture,
r1(esk1_0,esk9_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( p1(X1)
| p1(X2)
| p2(X3)
| ~ r1(esk1_0,X3)
| ~ r1(esk1_0,X1)
| ~ r1(esk1_0,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_10]),c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
( p1(X1)
| p1(X2)
| ~ r1(esk1_0,X2)
| ~ r1(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( p1(X1)
| ~ r1(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_6]),c_0_7]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_27]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL672+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.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 : Tue Jul 5 01:07:32 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.017 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 : 29
% 0.21/1.40 # Proof object clause steps : 22
% 0.21/1.40 # Proof object formula steps : 7
% 0.21/1.40 # Proof object conjectures : 23
% 0.21/1.40 # Proof object clause conjectures : 20
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 11
% 0.21/1.40 # Proof object initial formulas used : 3
% 0.21/1.40 # Proof object generating inferences : 11
% 0.21/1.40 # Proof object simplifying inferences : 12
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 3
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 20
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 20
% 0.21/1.40 # Processed clauses : 209
% 0.21/1.40 # ...of these trivial : 7
% 0.21/1.40 # ...subsumed : 27
% 0.21/1.40 # ...remaining for further processing : 175
% 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 : 67
% 0.21/1.40 # Backward-rewritten : 19
% 0.21/1.40 # Generated clauses : 2138
% 0.21/1.40 # ...of the previous two non-trivial : 2127
% 0.21/1.40 # Contextual simplify-reflections : 12
% 0.21/1.40 # Paramodulations : 2138
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 89
% 0.21/1.40 # Positive orientable unit clauses : 27
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 5
% 0.21/1.40 # Non-unit-clauses : 57
% 0.21/1.40 # Current number of unprocessed clauses: 110
% 0.21/1.40 # ...number of literals in the above : 383
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 86
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 16382
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 3228
% 0.21/1.40 # Non-unit clause-clause subsumptions : 102
% 0.21/1.40 # Unit Clause-clause subsumption calls : 668
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 55
% 0.21/1.40 # BW rewrite match successes : 19
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 52716
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.231 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.233 s
% 0.21/1.40 # Maximum resident set size: 4620 pages
% 0.21/23.42 eprover: CPU time limit exceeded, terminating
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.48 eprover: No such file or directory
% 0.21/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.21/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------