TSTP Solution File: SWC308-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC308-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:25:29 EDT 2024
% Result : Unsatisfiable 0.73s 0.58s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 13 unt; 15 nHn; 56 RR)
% Number of literals : 186 ( 68 equ; 124 neg)
% Maximal clause size : 11 ( 3 avg)
% Maximal term depth : 4 ( 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 : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| sk1 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk2) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk2) != X4
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_15,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_16,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
c_0_15 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_19,negated_conjecture,
( app(X1,cons(X2,nil)) = sk3
| app(cons(X2,nil),X1) != sk2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_18 ).
cnf(c_0_21,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| sk1 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk2) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk2) != X4
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_23,negated_conjecture,
( app(X1,cons(X2,nil)) = sk3
| cons(X2,X1) != sk2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_26,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| sk1 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk2) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk2) != X4
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
c_0_22 ).
cnf(c_0_28,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_29,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk3
| sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_25])]) ).
cnf(c_0_30,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_26 ).
cnf(c_0_31,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_32,negated_conjecture,
( sk1 != X1
| tl(sk2) != X2
| hd(sk2) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk2) ),
inference(cn,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk3
| sk2 = nil
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])]) ).
cnf(c_0_36,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) != sk3
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])])])])]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk3
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25])]) ).
cnf(c_0_39,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_40,negated_conjecture,
( sk2 = nil
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,negated_conjecture,
( sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_25])]) ).
cnf(c_0_44,negated_conjecture,
( sk2 = nil
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_30]),c_0_25])]) ).
cnf(c_0_45,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_46,negated_conjecture,
( sk2 = nil
| ~ ssList(cons(hd(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_25])]) ).
cnf(c_0_47,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_48,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_49,negated_conjecture,
( sk2 = nil
| ~ ssItem(hd(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_42])]) ).
cnf(c_0_50,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_48 ).
cnf(c_0_51,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_52,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_30]),c_0_25])]) ).
cnf(c_0_53,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC308-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:59:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/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.73/0.58 # Version: 3.1.0
% 0.73/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.73/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.73/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.58 # Starting sh5l with 300s (1) cores
% 0.73/0.58 # sh5l with pid 20941 completed with status 0
% 0.73/0.58 # Result found by sh5l
% 0.73/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.73/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.73/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.58 # Starting sh5l with 300s (1) cores
% 0.73/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.73/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.73/0.58 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.73/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 20951 completed with status 0
% 0.73/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.73/0.58 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.73/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.58 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.73/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.58 # Starting sh5l with 300s (1) cores
% 0.73/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.73/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.73/0.58 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.73/0.58 # Preprocessing time : 0.003 s
% 0.73/0.58 # Presaturation interreduction done
% 0.73/0.58
% 0.73/0.58 # Proof found!
% 0.73/0.58 # SZS status Unsatisfiable
% 0.73/0.58 # SZS output start CNFRefutation
% See solution above
% 0.73/0.58 # Parsed axioms : 195
% 0.73/0.58 # Removed by relevancy pruning/SinE : 30
% 0.73/0.58 # Initial clauses : 165
% 0.73/0.58 # Removed in clause preprocessing : 0
% 0.73/0.58 # Initial clauses in saturation : 165
% 0.73/0.58 # Processed clauses : 662
% 0.73/0.58 # ...of these trivial : 2
% 0.73/0.58 # ...subsumed : 226
% 0.73/0.58 # ...remaining for further processing : 434
% 0.73/0.58 # Other redundant clauses eliminated : 57
% 0.73/0.58 # Clauses deleted for lack of memory : 0
% 0.73/0.58 # Backward-subsumed : 14
% 0.73/0.58 # Backward-rewritten : 19
% 0.73/0.58 # Generated clauses : 1275
% 0.73/0.58 # ...of the previous two non-redundant : 1108
% 0.73/0.58 # ...aggressively subsumed : 0
% 0.73/0.58 # Contextual simplify-reflections : 26
% 0.73/0.58 # Paramodulations : 1217
% 0.73/0.58 # Factorizations : 0
% 0.73/0.58 # NegExts : 0
% 0.73/0.58 # Equation resolutions : 62
% 0.73/0.58 # Disequality decompositions : 0
% 0.73/0.58 # Total rewrite steps : 925
% 0.73/0.58 # ...of those cached : 865
% 0.73/0.58 # Propositional unsat checks : 0
% 0.73/0.58 # Propositional check models : 0
% 0.73/0.58 # Propositional check unsatisfiable : 0
% 0.73/0.58 # Propositional clauses : 0
% 0.73/0.58 # Propositional clauses after purity: 0
% 0.73/0.58 # Propositional unsat core size : 0
% 0.73/0.58 # Propositional preprocessing time : 0.000
% 0.73/0.58 # Propositional encoding time : 0.000
% 0.73/0.58 # Propositional solver time : 0.000
% 0.73/0.58 # Success case prop preproc time : 0.000
% 0.73/0.58 # Success case prop encoding time : 0.000
% 0.73/0.58 # Success case prop solver time : 0.000
% 0.73/0.58 # Current number of processed clauses : 223
% 0.73/0.58 # Positive orientable unit clauses : 48
% 0.73/0.58 # Positive unorientable unit clauses: 0
% 0.73/0.58 # Negative unit clauses : 0
% 0.73/0.58 # Non-unit-clauses : 175
% 0.73/0.58 # Current number of unprocessed clauses: 688
% 0.73/0.58 # ...number of literals in the above : 4150
% 0.73/0.58 # Current number of archived formulas : 0
% 0.73/0.58 # Current number of archived clauses : 190
% 0.73/0.58 # Clause-clause subsumption calls (NU) : 15812
% 0.73/0.58 # Rec. Clause-clause subsumption calls : 3204
% 0.73/0.58 # Non-unit clause-clause subsumptions : 266
% 0.73/0.58 # Unit Clause-clause subsumption calls : 237
% 0.73/0.58 # Rewrite failures with RHS unbound : 0
% 0.73/0.58 # BW rewrite match attempts : 6
% 0.73/0.58 # BW rewrite match successes : 6
% 0.73/0.58 # Condensation attempts : 0
% 0.73/0.58 # Condensation successes : 0
% 0.73/0.58 # Termbank termtop insertions : 30896
% 0.73/0.58 # Search garbage collected termcells : 632
% 0.73/0.58
% 0.73/0.58 # -------------------------------------------------
% 0.73/0.58 # User time : 0.058 s
% 0.73/0.58 # System time : 0.007 s
% 0.73/0.58 # Total time : 0.066 s
% 0.73/0.58 # Maximum resident set size: 2312 pages
% 0.73/0.58
% 0.73/0.58 # -------------------------------------------------
% 0.73/0.58 # User time : 0.061 s
% 0.73/0.58 # System time : 0.012 s
% 0.73/0.58 # Total time : 0.072 s
% 0.73/0.58 # Maximum resident set size: 1880 pages
% 0.73/0.58 % E---3.1 exiting
% 0.73/0.58 % E exiting
%------------------------------------------------------------------------------