TSTP Solution File: LCL656+1.001 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:17:32 EDT 2023
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% 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/tmp/tmp.h4Rn0S0W3w/E---3.1_12423.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.h4Rn0S0W3w/E---3.1_12423.p',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(fof_simplification,[status(thm)],[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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_4,negated_conjecture,
( p101(X1)
| ~ p2(esk2_1(X1))
| ~ p100(X1)
| ~ r1(esk1_0,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,
! [X12] : r1(X12,X12),
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,
( r1(X1,esk2_1(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(esk1_0,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.00/0.08 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n031.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 2400
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Mon Oct 2 12:45:43 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.h4Rn0S0W3w/E---3.1_12423.p
% 0.14/0.40 # Version: 3.1pre001
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # new_bool_3 with pid 12502 completed with status 0
% 0.14/0.40 # Result found by new_bool_3
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.14/0.40 # SAT001_CO_MinMin_p005000_rr with pid 12505 completed with status 0
% 0.14/0.40 # Result found by SAT001_CO_MinMin_p005000_rr
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FGUNF-FFSF11-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting SAT001_CO_MinMin_p005000_rr with 181s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 2
% 0.14/0.40 # Removed by relevancy pruning/SinE : 0
% 0.14/0.40 # Initial clauses : 18
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 18
% 0.14/0.40 # Processed clauses : 35
% 0.14/0.40 # ...of these trivial : 0
% 0.14/0.40 # ...subsumed : 1
% 0.14/0.40 # ...remaining for further processing : 34
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 0
% 0.14/0.40 # Generated clauses : 8
% 0.14/0.40 # ...of the previous two non-redundant : 5
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 1
% 0.14/0.40 # Paramodulations : 8
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Total rewrite steps : 2
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 17
% 0.14/0.40 # Positive orientable unit clauses : 2
% 0.14/0.40 # Positive unorientable unit clauses: 0
% 0.14/0.40 # Negative unit clauses : 1
% 0.14/0.40 # Non-unit-clauses : 14
% 0.14/0.40 # Current number of unprocessed clauses: 5
% 0.14/0.40 # ...number of literals in the above : 29
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 17
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 44
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 27
% 0.14/0.40 # Non-unit clause-clause subsumptions : 2
% 0.14/0.40 # Unit Clause-clause subsumption calls : 0
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 1
% 0.14/0.40 # BW rewrite match successes : 0
% 0.14/0.40 # Condensation attempts : 35
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 1774
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.003 s
% 0.14/0.40 # System time : 0.002 s
% 0.14/0.40 # Total time : 0.005 s
% 0.14/0.40 # Maximum resident set size: 1784 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.004 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.008 s
% 0.14/0.40 # Maximum resident set size: 1680 pages
% 0.14/0.40 % E---3.1 exiting
% 0.14/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------