TSTP Solution File: SWC243+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC243+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:24:52 EDT 2024
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 8 unt; 0 def)
% Number of atoms : 171 ( 47 equ)
% Maximal formula atoms : 33 ( 3 avg)
% Number of connectives : 218 ( 90 ~; 79 |; 20 &)
% ( 0 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 66 ( 0 sgn 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ totalorderedP(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) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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
| ~ totalorderedP(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) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_11,plain,
! [X48] :
( ~ ssItem(X48)
| ~ memberP(nil,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,negated_conjecture,
! [X13,X14,X15] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& totalorderedP(esk3_0)
& nil != esk1_0
& ( ssItem(esk5_3(X13,X14,X15))
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk1_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& ( memberP(X14,esk5_3(X13,X14,X15))
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk1_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& ( memberP(X15,esk5_3(X13,X14,X15))
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk1_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& ( lt(X13,esk5_3(X13,X14,X15))
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk1_0
| ~ ssList(X14)
| ~ ssItem(X13) )
& ( ~ leq(X13,esk5_3(X13,X14,X15))
| ~ ssList(X15)
| app(app(X14,cons(X13,nil)),X15) != esk1_0
| ~ ssList(X14)
| ~ ssItem(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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,
! [X56] :
( ~ ssList(X56)
| app(nil,X56) = X56 ),
inference(fof_nnf,[status(thm)],[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,
! [X63,X64] :
( ~ ssList(X63)
| ~ ssItem(X64)
| cons(X64,X63) = app(cons(X64,nil),X63) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_22,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_23,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_24,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_25,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_26,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
! [X71,X72] :
( ~ ssList(X71)
| ~ ssItem(X72)
| ssList(cons(X72,X71)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_28,plain,
! [X105] :
( ~ ssList(X105)
| nil = X105
| cons(hd(X105),tl(X105)) = X105 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_29,plain,
! [X108] :
( ~ ssList(X108)
| nil = X108
| ssList(tl(X108)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
fof(c_0_30,plain,
! [X98] :
( ~ ssList(X98)
| nil = X98
| ssItem(hd(X98)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_31,negated_conjecture,
( cons(X1,X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,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_31,c_0_32]),c_0_15])]) ).
cnf(c_0_39,negated_conjecture,
cons(hd(esk1_0),tl(esk1_0)) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ssList(tl(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_34]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
ssItem(hd(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC243+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:41:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.52 # Version: 3.1.0
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_3 with pid 21349 completed with status 0
% 0.19/0.52 # Result found by new_bool_3
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.19/0.52 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 21353 completed with status 0
% 0.19/0.52 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.19/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.003 s
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Theorem
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 96
% 0.19/0.52 # Removed by relevancy pruning/SinE : 52
% 0.19/0.52 # Initial clauses : 85
% 0.19/0.52 # Removed in clause preprocessing : 1
% 0.19/0.52 # Initial clauses in saturation : 84
% 0.19/0.52 # Processed clauses : 181
% 0.19/0.52 # ...of these trivial : 6
% 0.19/0.52 # ...subsumed : 27
% 0.19/0.52 # ...remaining for further processing : 148
% 0.19/0.52 # Other redundant clauses eliminated : 3
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 5
% 0.19/0.52 # Backward-rewritten : 6
% 0.19/0.52 # Generated clauses : 795
% 0.19/0.52 # ...of the previous two non-redundant : 694
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 14
% 0.19/0.52 # Paramodulations : 757
% 0.19/0.52 # Factorizations : 28
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 10
% 0.19/0.52 # Disequality decompositions : 0
% 0.19/0.52 # Total rewrite steps : 306
% 0.19/0.52 # ...of those cached : 289
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 135
% 0.19/0.52 # Positive orientable unit clauses : 17
% 0.19/0.52 # Positive unorientable unit clauses: 0
% 0.19/0.52 # Negative unit clauses : 4
% 0.19/0.52 # Non-unit-clauses : 114
% 0.19/0.52 # Current number of unprocessed clauses: 595
% 0.19/0.52 # ...number of literals in the above : 2708
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 11
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 1525
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 389
% 0.19/0.52 # Non-unit clause-clause subsumptions : 29
% 0.19/0.52 # Unit Clause-clause subsumption calls : 45
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 2
% 0.19/0.52 # BW rewrite match successes : 2
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 19444
% 0.19/0.52 # Search garbage collected termcells : 2205
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.026 s
% 0.19/0.52 # System time : 0.005 s
% 0.19/0.52 # Total time : 0.031 s
% 0.19/0.52 # Maximum resident set size: 2036 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.030 s
% 0.19/0.52 # System time : 0.006 s
% 0.19/0.52 # Total time : 0.036 s
% 0.19/0.52 # Maximum resident set size: 1820 pages
% 0.19/0.52 % E---3.1 exiting
% 0.19/0.52 % E exiting
%------------------------------------------------------------------------------