TSTP Solution File: SWC218+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:39:55 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 21 unt; 0 def)
% Number of atoms : 157 ( 63 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 169 ( 66 ~; 61 |; 15 &)
% ( 2 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 ) ) ) )
| neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax17) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax15) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax84) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.ieNXmDOsHz/E---3.1_28679.p',ax18) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X4
| ! [X7] :
( ssItem(X7)
=> app(app(X5,cons(X7,nil)),X6) != X3 ) ) ) )
| neq(X1,nil) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& ssList(esk6_0)
& app(esk5_0,esk6_0) = esk4_0
& ssItem(esk7_0)
& app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = esk3_0
& ~ neq(esk1_0,nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_10,plain,
! [X41,X42] :
( ( nil = X42
| nil != app(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( nil = X41
| nil != app(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) )
& ( nil != X42
| nil != X41
| nil = app(X41,X42)
| ~ ssList(X42)
| ~ ssList(X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_11,negated_conjecture,
app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
app(app(esk5_0,cons(esk7_0,nil)),esk6_0) = esk1_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X24,X25] :
( ~ ssList(X24)
| ~ ssList(X25)
| ssList(app(X24,X25)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_17,negated_conjecture,
( esk6_0 = nil
| esk1_0 != nil
| ~ ssList(app(esk5_0,cons(esk7_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X44,X45] :
( ~ ssList(X44)
| ~ ssItem(X45)
| ssList(cons(X45,X44)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_21,negated_conjecture,
( esk6_0 = nil
| esk1_0 != nil
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_25,plain,
! [X17,X18] :
( ( ~ neq(X17,X18)
| X17 != X18
| ~ ssList(X18)
| ~ ssList(X17) )
& ( X17 = X18
| neq(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_26,plain,
! [X43] :
( ~ ssList(X43)
| app(X43,nil) = X43 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_27,negated_conjecture,
app(esk5_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( esk6_0 = nil
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( app(esk5_0,nil) = esk4_0
| esk1_0 != nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
( esk5_0 = esk4_0
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19])]) ).
cnf(c_0_36,negated_conjecture,
esk1_0 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
esk5_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_38,negated_conjecture,
esk6_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_36])]) ).
cnf(c_0_39,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,negated_conjecture,
app(app(esk4_0,cons(esk7_0,nil)),nil) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_43,negated_conjecture,
( app(esk4_0,cons(esk7_0,nil)) = nil
| ~ ssList(app(esk4_0,cons(esk7_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23])]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( app(esk4_0,cons(esk7_0,nil)) = nil
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_18]),c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
( esk4_0 = nil
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_45]),c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_48,negated_conjecture,
( app(nil,cons(esk7_0,nil)) = nil
| ~ ssList(cons(esk7_0,nil)) ),
inference(rw,[status(thm)],[c_0_45,c_0_47]) ).
fof(c_0_49,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssItem(X47)
| cons(X47,X46) != X46 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
cnf(c_0_50,negated_conjecture,
( cons(esk7_0,nil) = nil
| ~ ssList(cons(esk7_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_48]),c_0_23])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_52,negated_conjecture,
cons(esk7_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC218+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n007.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:52:09 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.ieNXmDOsHz/E---3.1_28679.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 28758 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28761 completed with status 0
% 0.17/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 96
% 0.17/0.47 # Removed by relevancy pruning/SinE : 77
% 0.17/0.47 # Initial clauses : 39
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 39
% 0.17/0.47 # Processed clauses : 214
% 0.17/0.47 # ...of these trivial : 14
% 0.17/0.47 # ...subsumed : 53
% 0.17/0.47 # ...remaining for further processing : 147
% 0.17/0.47 # Other redundant clauses eliminated : 8
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 5
% 0.17/0.47 # Backward-rewritten : 54
% 0.17/0.47 # Generated clauses : 481
% 0.17/0.47 # ...of the previous two non-redundant : 424
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 470
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 12
% 0.17/0.47 # Total rewrite steps : 496
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 48
% 0.17/0.47 # Positive orientable unit clauses : 16
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 2
% 0.17/0.47 # Non-unit-clauses : 30
% 0.17/0.47 # Current number of unprocessed clauses: 251
% 0.17/0.47 # ...number of literals in the above : 911
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 96
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 692
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 465
% 0.17/0.47 # Non-unit clause-clause subsumptions : 55
% 0.17/0.47 # Unit Clause-clause subsumption calls : 54
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 6
% 0.17/0.47 # BW rewrite match successes : 6
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 9276
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.007 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.011 s
% 0.17/0.47 # Maximum resident set size: 1904 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.010 s
% 0.17/0.47 # System time : 0.005 s
% 0.17/0.47 # Total time : 0.015 s
% 0.17/0.47 # Maximum resident set size: 1800 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------