TSTP Solution File: SWC204-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC204-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:21 EDT 2024
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 59 ( 19 unt; 21 nHn; 59 RR)
% Number of literals : 143 ( 51 equ; 71 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 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 : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_16,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_17,negated_conjecture,
neq(sk2,nil),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_21,negated_conjecture,
( sk4 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| tl(sk4) != X2
| app(sk3,X2) != X1
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_25,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_26,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_27,negated_conjecture,
( ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(app(sk1,tl(sk4)))
| ~ ssList(tl(sk4)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])])])]) ).
cnf(c_0_29,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( X1 = sk1
| neq(sk1,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
~ neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_23])]) ).
cnf(c_0_33,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_34,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26])]) ).
cnf(c_0_35,negated_conjecture,
sk1 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_38,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
( app(nil,tl(sk4)) = sk4
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_37,c_0_18]) ).
cnf(c_0_42,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_43,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_44,negated_conjecture,
( tl(sk4) = sk4
| ~ neq(nil,sk4)
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_47,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_48,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_42 ).
cnf(c_0_49,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
( tl(sk4) = sk4
| sk4 = nil
| ~ neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( sk4 = nil
| neq(nil,sk4) ),
inference(spm,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_52,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_53,negated_conjecture,
( cons(hd(sk4),tl(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_49,c_0_41]) ).
cnf(c_0_55,negated_conjecture,
( tl(sk4) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_45]),c_0_54]),c_0_55]) ).
cnf(c_0_57,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC204-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n011.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 02:55:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_1 with pid 30532 completed with status 0
% 0.18/0.49 # Result found by new_bool_1
% 0.18/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30535 completed with status 0
% 0.18/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.49 # Preprocessing time : 0.002 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Unsatisfiable
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 197
% 0.18/0.49 # Removed by relevancy pruning/SinE : 129
% 0.18/0.49 # Initial clauses : 68
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 68
% 0.18/0.49 # Processed clauses : 202
% 0.18/0.49 # ...of these trivial : 5
% 0.18/0.49 # ...subsumed : 27
% 0.18/0.49 # ...remaining for further processing : 170
% 0.18/0.49 # Other redundant clauses eliminated : 15
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 3
% 0.18/0.49 # Backward-rewritten : 40
% 0.18/0.49 # Generated clauses : 306
% 0.18/0.49 # ...of the previous two non-redundant : 285
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 4
% 0.18/0.49 # Paramodulations : 289
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 19
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 217
% 0.18/0.49 # ...of those cached : 208
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 61
% 0.18/0.49 # Positive orientable unit clauses : 7
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 1
% 0.18/0.49 # Non-unit-clauses : 53
% 0.18/0.49 # Current number of unprocessed clauses: 193
% 0.18/0.49 # ...number of literals in the above : 1132
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 100
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 1956
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 294
% 0.18/0.49 # Non-unit clause-clause subsumptions : 34
% 0.18/0.49 # Unit Clause-clause subsumption calls : 59
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 3
% 0.18/0.49 # BW rewrite match successes : 3
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 9775
% 0.18/0.49 # Search garbage collected termcells : 864
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.016 s
% 0.18/0.49 # System time : 0.003 s
% 0.18/0.49 # Total time : 0.019 s
% 0.18/0.49 # Maximum resident set size: 2072 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.022 s
% 0.18/0.49 # System time : 0.003 s
% 0.18/0.49 # Total time : 0.025 s
% 0.18/0.49 # Maximum resident set size: 1876 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------