TSTP Solution File: SWC013+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC013+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 19:38:52 EDT 2023
% Result : Theorem 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 159 ( 51 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 210 ( 82 ~; 79 |; 34 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn; 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X4) = X6
& neq(nil,X4) ) )
| ? [X7] :
( ssList(X7)
& X1 = X7
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iq1jrexlCo/E---3.1_13351.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.iq1jrexlCo/E---3.1_13351.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.iq1jrexlCo/E---3.1_13351.p',ax17) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.iq1jrexlCo/E---3.1_13351.p',ax22) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.iq1jrexlCo/E---3.1_13351.p',ax16) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssItem(X6)
& cons(X6,nil) = X5
& hd(X4) = X6
& neq(nil,X4) ) )
| ? [X7] :
( ssList(X7)
& X1 = X7
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,negated_conjecture,
! [X13,X14,X15,X16] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X13)
| esk3_0 = X13
| ~ ssItem(X14)
| cons(X14,nil) != X13
| hd(esk4_0) != X14
| ~ neq(nil,esk4_0) )
& ( neq(esk2_0,nil)
| ~ ssList(X15)
| esk1_0 != X15
| ~ ssItem(X16)
| cons(X16,nil) != X15
| hd(esk2_0) != X16
| ~ neq(nil,esk2_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssList(X15)
| esk1_0 != X15
| ~ ssItem(X16)
| cons(X16,nil) != X15
| hd(esk2_0) != X16
| ~ neq(nil,esk2_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_5])])])])]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( ~ neq(esk4_0,nil)
| ~ ssList(X1)
| esk1_0 != X1
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(esk2_0) != X2
| ~ neq(nil,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( esk3_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(esk4_0) != X2
| ~ neq(nil,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( cons(hd(esk2_0),nil) != esk1_0
| ~ ssList(cons(hd(esk2_0),nil))
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10])])])]) ).
fof(c_0_14,plain,
! [X19,X20] :
( ( ~ neq(X19,X20)
| X19 != X20
| ~ ssList(X20)
| ~ ssList(X19) )
& ( X19 = X20
| neq(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ ssList(cons(hd(esk2_0),nil))
| ~ neq(nil,esk2_0)
| ~ ssItem(hd(esk2_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_9]),c_0_9]),c_0_9]),c_0_10])])])]),c_0_13]) ).
cnf(c_0_16,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_19,plain,
! [X26] :
( ~ ssList(X26)
| nil = X26
| ssItem(hd(X26)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_20,negated_conjecture,
( esk2_0 = nil
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X36,X37] :
( ~ ssList(X36)
| ~ ssItem(X37)
| ssList(cons(X37,X36)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_23,negated_conjecture,
( esk2_0 = nil
| ~ ssList(cons(hd(esk2_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17])]) ).
cnf(c_0_24,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( esk2_0 = nil
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18])]) ).
cnf(c_0_26,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_17])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_10,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC013+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Oct 3 01:56:46 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.iq1jrexlCo/E---3.1_13351.p
% 0.17/0.48 # Version: 3.1pre001
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # Starting sh5l with 300s (1) cores
% 0.17/0.48 # new_bool_1 with pid 13431 completed with status 0
% 0.17/0.48 # Result found by new_bool_1
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 13433 completed with status 0
% 0.17/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.17/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.17/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.17/0.48 # Preprocessing time : 0.002 s
% 0.17/0.48 # Presaturation interreduction done
% 0.17/0.48
% 0.17/0.48 # Proof found!
% 0.17/0.48 # SZS status Theorem
% 0.17/0.48 # SZS output start CNFRefutation
% See solution above
% 0.17/0.48 # Parsed axioms : 96
% 0.17/0.48 # Removed by relevancy pruning/SinE : 67
% 0.17/0.48 # Initial clauses : 51
% 0.17/0.48 # Removed in clause preprocessing : 0
% 0.17/0.48 # Initial clauses in saturation : 51
% 0.17/0.48 # Processed clauses : 93
% 0.17/0.48 # ...of these trivial : 5
% 0.17/0.48 # ...subsumed : 1
% 0.17/0.48 # ...remaining for further processing : 87
% 0.17/0.48 # Other redundant clauses eliminated : 8
% 0.17/0.48 # Clauses deleted for lack of memory : 0
% 0.17/0.48 # Backward-subsumed : 2
% 0.17/0.48 # Backward-rewritten : 6
% 0.17/0.48 # Generated clauses : 18
% 0.17/0.48 # ...of the previous two non-redundant : 15
% 0.17/0.48 # ...aggressively subsumed : 0
% 0.17/0.48 # Contextual simplify-reflections : 1
% 0.17/0.48 # Paramodulations : 13
% 0.17/0.48 # Factorizations : 0
% 0.17/0.48 # NegExts : 0
% 0.17/0.48 # Equation resolutions : 8
% 0.17/0.48 # Total rewrite steps : 43
% 0.17/0.48 # Propositional unsat checks : 0
% 0.17/0.48 # Propositional check models : 0
% 0.17/0.48 # Propositional check unsatisfiable : 0
% 0.17/0.48 # Propositional clauses : 0
% 0.17/0.48 # Propositional clauses after purity: 0
% 0.17/0.48 # Propositional unsat core size : 0
% 0.17/0.48 # Propositional preprocessing time : 0.000
% 0.17/0.48 # Propositional encoding time : 0.000
% 0.17/0.48 # Propositional solver time : 0.000
% 0.17/0.48 # Success case prop preproc time : 0.000
% 0.17/0.48 # Success case prop encoding time : 0.000
% 0.17/0.48 # Success case prop solver time : 0.000
% 0.17/0.48 # Current number of processed clauses : 29
% 0.17/0.48 # Positive orientable unit clauses : 9
% 0.17/0.48 # Positive unorientable unit clauses: 0
% 0.17/0.48 # Negative unit clauses : 1
% 0.17/0.48 # Non-unit-clauses : 19
% 0.17/0.48 # Current number of unprocessed clauses: 17
% 0.17/0.48 # ...number of literals in the above : 71
% 0.17/0.48 # Current number of archived formulas : 0
% 0.17/0.48 # Current number of archived clauses : 53
% 0.17/0.48 # Clause-clause subsumption calls (NU) : 307
% 0.17/0.48 # Rec. Clause-clause subsumption calls : 128
% 0.17/0.48 # Non-unit clause-clause subsumptions : 4
% 0.17/0.48 # Unit Clause-clause subsumption calls : 22
% 0.17/0.48 # Rewrite failures with RHS unbound : 0
% 0.17/0.48 # BW rewrite match attempts : 1
% 0.17/0.48 # BW rewrite match successes : 1
% 0.17/0.48 # Condensation attempts : 0
% 0.17/0.48 # Condensation successes : 0
% 0.17/0.48 # Termbank termtop insertions : 4820
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.006 s
% 0.17/0.48 # System time : 0.003 s
% 0.17/0.48 # Total time : 0.009 s
% 0.17/0.48 # Maximum resident set size: 1916 pages
% 0.17/0.48
% 0.17/0.48 # -------------------------------------------------
% 0.17/0.48 # User time : 0.009 s
% 0.17/0.48 # System time : 0.005 s
% 0.17/0.48 # Total time : 0.014 s
% 0.17/0.48 # Maximum resident set size: 1800 pages
% 0.17/0.48 % E---3.1 exiting
% 0.17/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------