TSTP Solution File: SWC211+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC211+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:53 EDT 2023
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 180 ( 78 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 205 ( 75 ~; 86 |; 25 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn; 28 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(X6,cons(X5,nil)) != X3
& app(cons(X5,nil),X6) = X4 ) )
| neq(X1,nil)
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',ax81) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',ax20) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.zk2ANdAlWb/E---3.1_14953.p',ax16) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(X6,cons(X5,nil)) != X3
& app(cons(X5,nil),X6) = X4 ) )
| neq(X1,nil)
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,negated_conjecture,
! [X11,X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( ~ ssItem(X11)
| ~ ssList(X12)
| app(X12,cons(X11,nil)) = esk3_0
| app(cons(X11,nil),X12) != esk4_0 )
& ~ neq(esk1_0,nil)
& ( nil = esk3_0
| nil != esk4_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_9,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X20,X21] :
( ( ~ neq(X20,X21)
| X20 != X21
| ~ ssList(X21)
| ~ ssList(X20) )
& ( X20 = X21
| neq(X20,X21)
| ~ ssList(X21)
| ~ ssList(X20) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_12,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ neq(esk3_0,nil),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( app(X2,cons(X1,nil)) = esk3_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
fof(c_0_19,plain,
! [X34,X35] :
( ~ ssList(X34)
| ~ ssItem(X35)
| cons(X35,X34) = app(cons(X35,nil),X34) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_20,negated_conjecture,
( app(X1,cons(X2,nil)) = nil
| app(cons(X2,nil),X1) != esk4_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X13] :
( ( ssList(esk5_1(X13))
| nil = X13
| ~ ssList(X13) )
& ( ssItem(esk6_1(X13))
| nil = X13
| ~ ssList(X13) )
& ( cons(esk6_1(X13),esk5_1(X13)) = X13
| nil = X13
| ~ ssList(X13) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
( app(X1,cons(X2,nil)) = nil
| cons(X2,X1) != esk4_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( cons(esk6_1(X1),esk5_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( app(esk5_1(esk4_0),cons(esk6_1(esk4_0),nil)) = nil
| esk4_0 = nil
| ~ ssList(esk5_1(esk4_0))
| ~ ssItem(esk6_1(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26])]),c_0_27])]) ).
cnf(c_0_29,plain,
( ssItem(esk6_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X39,X40] :
( ( nil = X40
| nil != app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) )
& ( nil = X39
| nil != app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) )
& ( nil != X40
| nil != X39
| nil = app(X39,X40)
| ~ ssList(X40)
| ~ ssList(X39) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])]) ).
cnf(c_0_31,negated_conjecture,
( app(esk5_1(esk4_0),cons(esk6_1(esk4_0),nil)) = nil
| esk4_0 = nil
| ~ ssList(esk5_1(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]) ).
cnf(c_0_32,plain,
( ssList(esk5_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( nil = X1
| nil != app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( app(esk5_1(esk4_0),cons(esk6_1(esk4_0),nil)) = nil
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( esk5_1(esk4_0) = nil
| esk4_0 = nil
| ~ ssList(cons(esk6_1(esk4_0),nil))
| ~ ssList(esk5_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_36,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssItem(X43)
| ssList(cons(X43,X42)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_37,negated_conjecture,
( esk5_1(esk4_0) = nil
| esk4_0 = nil
| ~ ssList(cons(esk6_1(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_27])]) ).
cnf(c_0_38,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( esk5_1(esk4_0) = nil
| esk4_0 = nil
| ~ ssItem(esk6_1(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_15])]) ).
cnf(c_0_40,negated_conjecture,
( esk5_1(esk4_0) = nil
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_27])]) ).
cnf(c_0_41,negated_conjecture,
( cons(esk6_1(esk4_0),nil) = esk4_0
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_27])]) ).
cnf(c_0_42,plain,
( nil = X1
| nil != app(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,negated_conjecture,
( app(esk5_1(esk4_0),esk4_0) = nil
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_34,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_45,negated_conjecture,
( esk4_0 = nil
| ~ ssList(esk5_1(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_27])]) ).
cnf(c_0_46,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_44,c_0_24]) ).
cnf(c_0_47,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_15])]) ).
cnf(c_0_48,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC211+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:14:13 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.zk2ANdAlWb/E---3.1_14953.p
% 0.16/0.46 # Version: 3.1pre001
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 # Starting sh5l with 300s (1) cores
% 0.16/0.46 # new_bool_3 with pid 15032 completed with status 0
% 0.16/0.46 # Result found by new_bool_3
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 15035 completed with status 0
% 0.16/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.16/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% See solution above
% 0.16/0.46 # Parsed axioms : 96
% 0.16/0.46 # Removed by relevancy pruning/SinE : 77
% 0.16/0.46 # Initial clauses : 37
% 0.16/0.46 # Removed in clause preprocessing : 0
% 0.16/0.46 # Initial clauses in saturation : 37
% 0.16/0.46 # Processed clauses : 119
% 0.16/0.46 # ...of these trivial : 2
% 0.16/0.46 # ...subsumed : 15
% 0.16/0.46 # ...remaining for further processing : 102
% 0.16/0.46 # Other redundant clauses eliminated : 13
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 6
% 0.16/0.46 # Backward-rewritten : 16
% 0.16/0.46 # Generated clauses : 169
% 0.16/0.46 # ...of the previous two non-redundant : 132
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 7
% 0.16/0.46 # Paramodulations : 153
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 17
% 0.16/0.46 # Total rewrite steps : 130
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 42
% 0.16/0.46 # Positive orientable unit clauses : 7
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 2
% 0.16/0.46 # Non-unit-clauses : 33
% 0.16/0.46 # Current number of unprocessed clauses: 82
% 0.16/0.46 # ...number of literals in the above : 417
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 57
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 602
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 243
% 0.16/0.46 # Non-unit clause-clause subsumptions : 28
% 0.16/0.46 # Unit Clause-clause subsumption calls : 15
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 2
% 0.16/0.46 # BW rewrite match successes : 2
% 0.16/0.46 # Condensation attempts : 0
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 6033
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.009 s
% 0.16/0.46 # System time : 0.002 s
% 0.16/0.46 # Total time : 0.011 s
% 0.16/0.46 # Maximum resident set size: 1884 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.013 s
% 0.16/0.46 # System time : 0.004 s
% 0.16/0.46 # Total time : 0.016 s
% 0.16/0.46 # Maximum resident set size: 1800 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------