TSTP Solution File: SWC003+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC003+1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:22:31 EDT 2024
% Result : Theorem 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 188 ( 48 equ)
% Maximal formula atoms : 54 ( 4 avg)
% Number of connectives : 237 ( 87 ~; 84 |; 40 &)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn 34 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1
& neq(X6,nil) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3
| ? [X11] :
( ssItem(X11)
& X8 != X11
& memberP(X4,X11)
& geq(X11,X8) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X1
& neq(X6,nil) ) ) )
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(X9,cons(X8,nil)),X10) != X4
| app(X9,X10) != X3
| ? [X11] :
( ssItem(X11)
& X8 != X11
& memberP(X4,X11)
& geq(X11,X8) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_6,negated_conjecture,
! [X260,X261,X262,X266] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& ( ~ neq(esk51_0,nil)
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ ssList(X260)
| ~ ssList(X261)
| ~ ssList(X262)
| app(app(X260,X261),X262) != esk49_0
| app(X260,X262) != esk48_0
| ~ neq(X261,nil) )
& ( ~ neq(esk51_0,nil)
| ~ ssList(X260)
| ~ ssList(X261)
| ~ ssList(X262)
| app(app(X260,X261),X262) != esk49_0
| app(X260,X262) != esk48_0
| ~ neq(X261,nil) )
& ( neq(esk49_0,nil)
| ssItem(esk52_0) )
& ( ~ neq(esk51_0,nil)
| ssItem(esk52_0) )
& ( neq(esk49_0,nil)
| ssList(esk53_0) )
& ( ~ neq(esk51_0,nil)
| ssList(esk53_0) )
& ( neq(esk49_0,nil)
| ssList(esk54_0) )
& ( ~ neq(esk51_0,nil)
| ssList(esk54_0) )
& ( neq(esk49_0,nil)
| app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0 )
& ( ~ neq(esk51_0,nil)
| app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0 )
& ( neq(esk49_0,nil)
| app(esk53_0,esk54_0) = esk50_0 )
& ( ~ neq(esk51_0,nil)
| app(esk53_0,esk54_0) = esk50_0 )
& ( neq(esk49_0,nil)
| ~ ssItem(X266)
| esk52_0 = X266
| ~ memberP(esk51_0,X266)
| ~ geq(X266,esk52_0) )
& ( ~ neq(esk51_0,nil)
| ~ ssItem(X266)
| esk52_0 = X266
| ~ memberP(esk51_0,X266)
| ~ geq(X266,esk52_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_5])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_9,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,X2),X3) != esk49_0
| app(X1,X3) != esk48_0
| ~ neq(X2,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( app(esk53_0,esk54_0) = esk50_0
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
( ssList(esk54_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( ssList(esk53_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
( app(app(X1,X2),X3) != esk51_0
| app(X1,X3) != esk48_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X2,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
app(esk53_0,esk54_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11])]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
( app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_21,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_22,negated_conjecture,
( app(app(esk53_0,X1),esk54_0) != esk51_0
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
app(app(esk53_0,cons(esk52_0,nil)),esk54_0) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_11])]) ).
fof(c_0_24,plain,
! [X114,X115] :
( ( ~ neq(X114,X115)
| X114 != X115
| ~ ssList(X115)
| ~ ssList(X114) )
& ( X114 = X115
| neq(X114,X115)
| ~ ssList(X115)
| ~ ssList(X114) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])]) ).
fof(c_0_25,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ neq(cons(esk52_0,nil),nil) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X116,X117] :
( ~ ssList(X116)
| ~ ssItem(X117)
| ssList(cons(X117,X116)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_30,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_31,plain,
! [X118,X119] :
( ~ ssList(X118)
| ~ ssItem(X119)
| cons(X119,X118) != X118 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_32,negated_conjecture,
( cons(esk52_0,nil) = nil
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
ssItem(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_11])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
cons(esk52_0,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28]),c_0_34])]) ).
cnf(c_0_37,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_28]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC003+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 02:49:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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/benchmark/theBenchmark.p
% 0.19/0.54 # Version: 3.1.0
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3496 completed with status 0
% 0.19/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.19/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 3507 completed with status 0
% 0.19/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.19/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.54 # No SInE strategy applied
% 0.19/0.54 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.19/0.54 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.54 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.19/0.54 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.19/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.19/0.54 # Preprocessing time : 0.004 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Theorem
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 96
% 0.19/0.54 # Removed by relevancy pruning/SinE : 0
% 0.19/0.54 # Initial clauses : 212
% 0.19/0.54 # Removed in clause preprocessing : 2
% 0.19/0.54 # Initial clauses in saturation : 210
% 0.19/0.54 # Processed clauses : 421
% 0.19/0.54 # ...of these trivial : 10
% 0.19/0.54 # ...subsumed : 28
% 0.19/0.54 # ...remaining for further processing : 383
% 0.19/0.54 # Other redundant clauses eliminated : 29
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 1
% 0.19/0.54 # Backward-rewritten : 3
% 0.19/0.54 # Generated clauses : 137
% 0.19/0.54 # ...of the previous two non-redundant : 101
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 12
% 0.19/0.54 # Paramodulations : 110
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 29
% 0.19/0.54 # Disequality decompositions : 0
% 0.19/0.54 # Total rewrite steps : 102
% 0.19/0.54 # ...of those cached : 90
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 160
% 0.19/0.54 # Positive orientable unit clauses : 25
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 2
% 0.19/0.54 # Non-unit-clauses : 133
% 0.19/0.54 # Current number of unprocessed clauses: 84
% 0.19/0.54 # ...number of literals in the above : 439
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 200
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 13965
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 4036
% 0.19/0.54 # Non-unit clause-clause subsumptions : 39
% 0.19/0.54 # Unit Clause-clause subsumption calls : 0
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 1
% 0.19/0.54 # BW rewrite match successes : 1
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 21487
% 0.19/0.54 # Search garbage collected termcells : 4466
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.040 s
% 0.19/0.54 # System time : 0.009 s
% 0.19/0.54 # Total time : 0.049 s
% 0.19/0.54 # Maximum resident set size: 2500 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.168 s
% 0.19/0.54 # System time : 0.022 s
% 0.19/0.54 # Total time : 0.189 s
% 0.19/0.54 # Maximum resident set size: 1824 pages
% 0.19/0.54 % E---3.1 exiting
% 0.19/0.55 % E exiting
%------------------------------------------------------------------------------