TSTP Solution File: SWC234+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC234+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:43 EDT 2024
% Result : Theorem 0.40s 0.55s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 185 ( 56 equ)
% Maximal formula atoms : 42 ( 5 avg)
% Number of connectives : 249 ( 100 ~; 97 |; 38 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn 33 !; 14 ?)
% 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
| 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)
| ~ leq(X5,X8)
| lt(X5,X8) ) ) ) )
| ! [X9] :
( ~ ssList(X9)
| app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_7,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_8,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)
| ~ leq(X5,X8)
| lt(X5,X8) ) ) ) )
| ! [X9] :
( ~ ssList(X9)
| app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,plain,
! [X101] :
( ~ ssItem(X101)
| ~ memberP(nil,X101) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,negated_conjecture,
! [X17,X18,X19,X22,X23,X24] :
( 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(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( leq(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ lt(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ssList(esk6_0)
& app(esk3_0,esk6_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X22)
| ~ ssList(X23)
| app(cons(X22,nil),X23) != esk6_0
| ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 ) ),
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_8])])])])])]) ).
cnf(c_0_11,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,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_10]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,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_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,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_10]) ).
fof(c_0_16,plain,
! [X35] :
( ~ ssList(X35)
| app(nil,X35) = X35 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_17,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_14,c_0_15]),c_0_13])]) ).
cnf(c_0_18,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X42,X43] :
( ~ ssList(X42)
| ~ ssItem(X43)
| cons(X43,X42) = app(cons(X43,nil),X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_20,negated_conjecture,
( app(cons(X1,nil),X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[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,
! [X50,X51] :
( ~ ssList(X50)
| ~ ssItem(X51)
| ssList(cons(X51,X50)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_23,plain,
! [X25] :
( ( ssList(esk7_1(X25))
| nil = X25
| ~ ssList(X25) )
& ( ssItem(esk8_1(X25))
| nil = X25
| ~ ssList(X25) )
& ( cons(esk8_1(X25),esk7_1(X25)) = X25
| nil = X25
| ~ ssList(X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_24,negated_conjecture,
( cons(X1,X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( cons(esk8_1(X1),esk7_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,plain,
( ssList(esk7_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( ssItem(esk8_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,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_24,c_0_25]),c_0_13])]) ).
cnf(c_0_32,negated_conjecture,
cons(esk8_1(esk1_0),esk7_1(esk1_0)) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
ssList(esk7_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
ssItem(esk8_1(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_28]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC234+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.12/0.36 % Computer : n008.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8042.1875MB
% 0.12/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun May 19 02:56:38 EDT 2024
% 0.12/0.36 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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.40/0.54 # Version: 3.1.0
% 0.40/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.40/0.54 # Starting sh5l with 300s (1) cores
% 0.40/0.54 # new_bool_3 with pid 14354 completed with status 0
% 0.40/0.54 # Result found by new_bool_3
% 0.40/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.54 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.40/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.40/0.54 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 14358 completed with status 0
% 0.40/0.54 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.40/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.40/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.40/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.40/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.55 # Search class: FGHSF-FFMM31-MFFFFFNN
% 0.40/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.55 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 0.40/0.55 # Preprocessing time : 0.003 s
% 0.40/0.55
% 0.40/0.55 # Proof found!
% 0.40/0.55 # SZS status Theorem
% 0.40/0.55 # SZS output start CNFRefutation
% See solution above
% 0.40/0.55 # Parsed axioms : 96
% 0.40/0.55 # Removed by relevancy pruning/SinE : 63
% 0.40/0.55 # Initial clauses : 71
% 0.40/0.55 # Removed in clause preprocessing : 0
% 0.40/0.55 # Initial clauses in saturation : 71
% 0.40/0.55 # Processed clauses : 286
% 0.40/0.55 # ...of these trivial : 8
% 0.40/0.55 # ...subsumed : 82
% 0.40/0.55 # ...remaining for further processing : 196
% 0.40/0.55 # Other redundant clauses eliminated : 3
% 0.40/0.55 # Clauses deleted for lack of memory : 0
% 0.40/0.55 # Backward-subsumed : 13
% 0.40/0.55 # Backward-rewritten : 0
% 0.40/0.55 # Generated clauses : 1109
% 0.40/0.55 # ...of the previous two non-redundant : 999
% 0.40/0.55 # ...aggressively subsumed : 0
% 0.40/0.55 # Contextual simplify-reflections : 28
% 0.40/0.55 # Paramodulations : 1096
% 0.40/0.55 # Factorizations : 2
% 0.40/0.55 # NegExts : 0
% 0.40/0.55 # Equation resolutions : 11
% 0.40/0.55 # Disequality decompositions : 0
% 0.40/0.55 # Total rewrite steps : 435
% 0.40/0.55 # ...of those cached : 421
% 0.40/0.55 # Propositional unsat checks : 0
% 0.40/0.55 # Propositional check models : 0
% 0.40/0.55 # Propositional check unsatisfiable : 0
% 0.40/0.55 # Propositional clauses : 0
% 0.40/0.55 # Propositional clauses after purity: 0
% 0.40/0.55 # Propositional unsat core size : 0
% 0.40/0.55 # Propositional preprocessing time : 0.000
% 0.40/0.55 # Propositional encoding time : 0.000
% 0.40/0.55 # Propositional solver time : 0.000
% 0.40/0.55 # Success case prop preproc time : 0.000
% 0.40/0.55 # Success case prop encoding time : 0.000
% 0.40/0.55 # Success case prop solver time : 0.000
% 0.40/0.55 # Current number of processed clauses : 181
% 0.40/0.55 # Positive orientable unit clauses : 19
% 0.40/0.55 # Positive unorientable unit clauses: 0
% 0.40/0.55 # Negative unit clauses : 12
% 0.40/0.55 # Non-unit-clauses : 150
% 0.40/0.55 # Current number of unprocessed clauses: 780
% 0.40/0.55 # ...number of literals in the above : 3717
% 0.40/0.55 # Current number of archived formulas : 0
% 0.40/0.55 # Current number of archived clauses : 13
% 0.40/0.55 # Clause-clause subsumption calls (NU) : 2561
% 0.40/0.55 # Rec. Clause-clause subsumption calls : 689
% 0.40/0.55 # Non-unit clause-clause subsumptions : 83
% 0.40/0.55 # Unit Clause-clause subsumption calls : 226
% 0.40/0.55 # Rewrite failures with RHS unbound : 0
% 0.40/0.55 # BW rewrite match attempts : 0
% 0.40/0.55 # BW rewrite match successes : 0
% 0.40/0.55 # Condensation attempts : 0
% 0.40/0.55 # Condensation successes : 0
% 0.40/0.55 # Termbank termtop insertions : 25169
% 0.40/0.55 # Search garbage collected termcells : 2022
% 0.40/0.55
% 0.40/0.55 # -------------------------------------------------
% 0.40/0.55 # User time : 0.041 s
% 0.40/0.55 # System time : 0.002 s
% 0.40/0.55 # Total time : 0.043 s
% 0.40/0.55 # Maximum resident set size: 2032 pages
% 0.40/0.55
% 0.40/0.55 # -------------------------------------------------
% 0.40/0.55 # User time : 0.044 s
% 0.40/0.55 # System time : 0.003 s
% 0.40/0.55 # Total time : 0.047 s
% 0.40/0.55 # Maximum resident set size: 1828 pages
% 0.40/0.55 % E---3.1 exiting
% 0.64/0.55 % E exiting
%------------------------------------------------------------------------------