TSTP Solution File: SWC248+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC248+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:40:05 EDT 2023
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 219 ( 64 equ)
% Maximal formula atoms : 52 ( 5 avg)
% Number of connectives : 291 ( 112 ~; 106 |; 52 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 91 ( 0 sgn; 44 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax38) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,X3),X10) != X4
| ~ totalorderedP(X3)
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X9
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(cons(X13,nil),X14) = X3
& leq(X11,X13) ) ) ) )
| ? [X15] :
( ssItem(X15)
& ? [X16] :
( ssList(X16)
& app(cons(X15,nil),X16) = X10
& ? [X17] :
( ssItem(X17)
& ? [X18] :
( ssList(X18)
& app(X18,cons(X17,nil)) = X3
& leq(X17,X15) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax16) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax24) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.QCzor5vEq1/E---3.1_7101.p',ax22) ).
fof(c_0_9,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ lt(X5,X8)
| leq(X5,X8) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ! [X10] :
( ~ ssList(X10)
| app(app(X9,X3),X10) != X4
| ~ totalorderedP(X3)
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ssList(X12)
& app(X12,cons(X11,nil)) = X9
& ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(cons(X13,nil),X14) = X3
& leq(X11,X13) ) ) ) )
| ? [X15] :
( ssItem(X15)
& ? [X16] :
( ssList(X16)
& app(cons(X15,nil),X16) = X10
& ? [X17] :
( ssItem(X17)
& ? [X18] :
( ssList(X18)
& app(X18,cons(X17,nil)) = X3
& leq(X17,X15) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_11,plain,
! [X117] :
( ~ ssItem(X117)
| ~ memberP(nil,X117) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
fof(c_0_12,negated_conjecture,
! [X23,X24,X25,X29,X30,X31,X32,X33,X34,X35,X36] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssItem(esk5_3(X23,X24,X25))
| ~ ssList(X25)
| app(app(X24,cons(X23,nil)),X25) != esk1_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& ( memberP(X24,esk5_3(X23,X24,X25))
| ~ ssList(X25)
| app(app(X24,cons(X23,nil)),X25) != esk1_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& ( memberP(X25,esk5_3(X23,X24,X25))
| ~ ssList(X25)
| app(app(X24,cons(X23,nil)),X25) != esk1_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& ( lt(X23,esk5_3(X23,X24,X25))
| ~ ssList(X25)
| app(app(X24,cons(X23,nil)),X25) != esk1_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& ( ~ leq(X23,esk5_3(X23,X24,X25))
| ~ ssList(X25)
| app(app(X24,cons(X23,nil)),X25) != esk1_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& ssList(esk6_0)
& ssList(esk7_0)
& app(app(esk6_0,esk3_0),esk7_0) = esk4_0
& totalorderedP(esk3_0)
& ( ~ ssItem(X29)
| ~ ssList(X30)
| app(X30,cons(X29,nil)) != esk6_0
| ~ ssItem(X31)
| ~ ssList(X32)
| app(cons(X31,nil),X32) != esk3_0
| ~ leq(X29,X31) )
& ( ~ ssItem(X33)
| ~ ssList(X34)
| app(cons(X33,nil),X34) != esk7_0
| ~ ssItem(X35)
| ~ ssList(X36)
| app(X36,cons(X35,nil)) != esk3_0
| ~ leq(X35,X33) )
& ( nil = esk4_0
| nil != esk3_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_10])])])])]) ).
cnf(c_0_13,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( memberP(X1,esk5_3(X2,X1,X3))
| ~ ssList(X3)
| app(app(X1,cons(X2,nil)),X3) != esk1_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_16,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(esk5_3(X1,nil,X2))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X60] :
( ~ ssList(X60)
| app(nil,X60) = X60 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15])]) ).
cnf(c_0_20,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X67,X68] :
( ~ ssList(X67)
| ~ ssItem(X68)
| cons(X68,X67) = app(cons(X68,nil),X67) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_22,negated_conjecture,
( app(cons(X1,nil),X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_24,plain,
! [X75,X76] :
( ~ ssList(X75)
| ~ ssItem(X76)
| ssList(cons(X76,X75)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
fof(c_0_25,plain,
! [X125] :
( ~ ssList(X125)
| nil = X125
| cons(hd(X125),tl(X125)) = X125 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_26,plain,
! [X128] :
( ~ ssList(X128)
| nil = X128
| ssList(tl(X128)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
fof(c_0_27,plain,
! [X118] :
( ~ ssList(X118)
| nil = X118
| ssItem(hd(X118)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_28,negated_conjecture,
( cons(X1,X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( cons(X1,X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15])]) ).
cnf(c_0_36,negated_conjecture,
cons(hd(esk1_0),tl(esk1_0)) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
ssList(tl(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_32]) ).
cnf(c_0_38,negated_conjecture,
ssItem(hd(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC248+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:01:45 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.QCzor5vEq1/E---3.1_7101.p
% 0.21/0.56 # Version: 3.1pre001
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # new_bool_3 with pid 7181 completed with status 0
% 0.21/0.56 # Result found by new_bool_3
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.21/0.56 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7184 completed with status 0
% 0.21/0.56 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.21/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.56 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.21/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.56 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.21/0.56 # Preprocessing time : 0.004 s
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 96
% 0.21/0.56 # Removed by relevancy pruning/SinE : 52
% 0.21/0.56 # Initial clauses : 91
% 0.21/0.56 # Removed in clause preprocessing : 1
% 0.21/0.56 # Initial clauses in saturation : 90
% 0.21/0.56 # Processed clauses : 262
% 0.21/0.56 # ...of these trivial : 6
% 0.21/0.56 # ...subsumed : 42
% 0.21/0.56 # ...remaining for further processing : 214
% 0.21/0.56 # Other redundant clauses eliminated : 3
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 23
% 0.21/0.56 # Backward-rewritten : 6
% 0.21/0.56 # Generated clauses : 1167
% 0.21/0.56 # ...of the previous two non-redundant : 1050
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 10
% 0.21/0.56 # Paramodulations : 1123
% 0.21/0.56 # Factorizations : 28
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 11
% 0.21/0.56 # Total rewrite steps : 444
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 178
% 0.21/0.56 # Positive orientable unit clauses : 26
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 7
% 0.21/0.56 # Non-unit-clauses : 145
% 0.21/0.56 # Current number of unprocessed clauses: 865
% 0.21/0.56 # ...number of literals in the above : 3529
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 34
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 2738
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 810
% 0.21/0.56 # Non-unit clause-clause subsumptions : 43
% 0.21/0.56 # Unit Clause-clause subsumption calls : 298
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 2
% 0.21/0.56 # BW rewrite match successes : 2
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 24107
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.025 s
% 0.21/0.56 # System time : 0.007 s
% 0.21/0.56 # Total time : 0.032 s
% 0.21/0.56 # Maximum resident set size: 2084 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.028 s
% 0.21/0.56 # System time : 0.009 s
% 0.21/0.56 # Total time : 0.038 s
% 0.21/0.56 # Maximum resident set size: 1820 pages
% 0.21/0.56 % E---3.1 exiting
% 0.21/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------