TSTP Solution File: LCL686+1.001 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:21:37 EDT 2023
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 158 ( 77 ~; 61 |; 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 : 33 ( 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/tmp/tmp.mt1ZMXWTQe/E---3.1_8629.p',main) ).
fof(reflexivity,axiom,
! [X1] : r1(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.mt1ZMXWTQe/E---3.1_8629.p',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)
| ~ ! [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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])]) ).
fof(c_0_3,negated_conjecture,
! [X8,X10] :
( r1(esk1_0,esk2_0)
& p3(esk2_0)
& r1(esk2_0,esk3_0)
& p1(esk3_0)
& r1(esk1_0,esk4_0)
& ( r1(X8,esk5_1(X8))
| ~ r1(esk4_0,X8) )
& ( ~ p2(X10)
| p1(X10)
| ~ r1(X8,X10)
| ~ r1(esk4_0,X8) )
& ( p2(X10)
| ~ p1(X10)
| ~ r1(X8,X10)
| ~ r1(esk4_0,X8) )
& ( r1(X8,esk6_1(X8))
| ~ r1(esk4_0,X8) )
& ( ~ p3(esk6_1(X8))
| ~ r1(esk4_0,X8) )
& ( r1(X8,esk7_1(X8))
| ~ r1(esk4_0,X8) )
& ( p1(esk7_1(X8))
| p2(esk7_1(X8))
| ~ r1(esk4_0,X8) )
& ( ~ p2(esk7_1(X8))
| ~ p1(esk7_1(X8))
| ~ r1(esk4_0,X8) ) ),
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])])])])]) ).
fof(c_0_4,plain,
! [X13] : r1(X13,X13),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_5,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( r1(X1,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
r1(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(X2,X1)
| ~ r1(esk4_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( p1(X1)
| ~ p2(X1)
| ~ r1(esk7_1(esk4_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_10,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_11,negated_conjecture,
( p2(X1)
| ~ p1(X1)
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( p1(esk7_1(esk4_0))
| ~ p2(esk7_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( p1(esk7_1(X1))
| p2(esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ p1(esk7_1(X1))
| ~ r1(esk4_0,esk7_1(X1))
| ~ r1(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
p1(esk7_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
~ r1(esk4_0,esk7_1(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n023.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 13:27:07 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.mt1ZMXWTQe/E---3.1_8629.p
% 0.14/0.41 # Version: 3.1pre001
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # sh5l with pid 8710 completed with status 0
% 0.14/0.41 # Result found by sh5l
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # SAT001_MinMin_p005000_rr_RG with pid 8716 completed with status 0
% 0.14/0.41 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 # Starting sh5l with 300s (1) cores
% 0.14/0.41 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41 # Search class: FGHNF-FFSS11-SFFFFFNN
% 0.14/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.41 # Preprocessing time : 0.001 s
% 0.14/0.41 # Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 # Proof found!
% 0.14/0.41 # SZS status Theorem
% 0.14/0.41 # SZS output start CNFRefutation
% See solution above
% 0.14/0.41 # Parsed axioms : 3
% 0.14/0.41 # Removed by relevancy pruning/SinE : 0
% 0.14/0.41 # Initial clauses : 15
% 0.14/0.41 # Removed in clause preprocessing : 0
% 0.14/0.41 # Initial clauses in saturation : 15
% 0.14/0.41 # Processed clauses : 43
% 0.14/0.41 # ...of these trivial : 0
% 0.14/0.41 # ...subsumed : 0
% 0.14/0.41 # ...remaining for further processing : 43
% 0.14/0.41 # Other redundant clauses eliminated : 0
% 0.14/0.41 # Clauses deleted for lack of memory : 0
% 0.14/0.41 # Backward-subsumed : 1
% 0.14/0.41 # Backward-rewritten : 1
% 0.14/0.41 # Generated clauses : 39
% 0.14/0.41 # ...of the previous two non-redundant : 30
% 0.14/0.41 # ...aggressively subsumed : 0
% 0.14/0.41 # Contextual simplify-reflections : 1
% 0.14/0.41 # Paramodulations : 39
% 0.14/0.41 # Factorizations : 0
% 0.14/0.41 # NegExts : 0
% 0.14/0.41 # Equation resolutions : 0
% 0.14/0.41 # Total rewrite steps : 14
% 0.14/0.41 # Propositional unsat checks : 0
% 0.14/0.41 # Propositional check models : 0
% 0.14/0.41 # Propositional check unsatisfiable : 0
% 0.14/0.41 # Propositional clauses : 0
% 0.14/0.41 # Propositional clauses after purity: 0
% 0.14/0.41 # Propositional unsat core size : 0
% 0.14/0.41 # Propositional preprocessing time : 0.000
% 0.14/0.41 # Propositional encoding time : 0.000
% 0.14/0.41 # Propositional solver time : 0.000
% 0.14/0.41 # Success case prop preproc time : 0.000
% 0.14/0.41 # Success case prop encoding time : 0.000
% 0.14/0.41 # Success case prop solver time : 0.000
% 0.14/0.41 # Current number of processed clauses : 26
% 0.14/0.41 # Positive orientable unit clauses : 7
% 0.14/0.41 # Positive unorientable unit clauses: 0
% 0.14/0.41 # Negative unit clauses : 1
% 0.14/0.41 # Non-unit-clauses : 18
% 0.14/0.41 # Current number of unprocessed clauses: 17
% 0.14/0.41 # ...number of literals in the above : 52
% 0.14/0.41 # Current number of archived formulas : 0
% 0.14/0.41 # Current number of archived clauses : 17
% 0.14/0.41 # Clause-clause subsumption calls (NU) : 89
% 0.14/0.41 # Rec. Clause-clause subsumption calls : 71
% 0.14/0.41 # Non-unit clause-clause subsumptions : 1
% 0.14/0.41 # Unit Clause-clause subsumption calls : 3
% 0.14/0.41 # Rewrite failures with RHS unbound : 0
% 0.14/0.41 # BW rewrite match attempts : 6
% 0.14/0.41 # BW rewrite match successes : 1
% 0.14/0.41 # Condensation attempts : 0
% 0.14/0.41 # Condensation successes : 0
% 0.14/0.41 # Termbank termtop insertions : 1411
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.005 s
% 0.14/0.41 # System time : 0.001 s
% 0.14/0.41 # Total time : 0.006 s
% 0.14/0.41 # Maximum resident set size: 1728 pages
% 0.14/0.41
% 0.14/0.41 # -------------------------------------------------
% 0.14/0.41 # User time : 0.005 s
% 0.14/0.41 # System time : 0.004 s
% 0.14/0.41 # Total time : 0.008 s
% 0.14/0.41 # Maximum resident set size: 1676 pages
% 0.14/0.41 % E---3.1 exiting
% 0.14/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------