TSTP Solution File: SWC316-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC316-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:35 EDT 2024
% Result : Unsatisfiable 0.53s 0.55s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 65 ( 22 unt; 6 nHn; 65 RR)
% Number of literals : 182 ( 54 equ; 123 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_18,negated_conjecture,
( ~ ssList(X1)
| sk2 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk1) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk1) != X4
| ~ neq(nil,sk1)
| ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_17,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_17,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_20,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X1)
| sk2 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk1) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk1) != X4
| ~ neq(nil,sk1)
| ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_22,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_26,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_19 ).
cnf(c_0_28,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(X1)
| sk2 != X1
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk1) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk1) != X4
| ~ neq(nil,sk1)
| ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
c_0_21 ).
cnf(c_0_30,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_31,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_32,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_33,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_26 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_24]),c_0_25])]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_24]),c_0_25])]) ).
cnf(c_0_36,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_37,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_38,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_39,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_40,negated_conjecture,
( sk2 != X1
| tl(sk1) != X2
| hd(sk1) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_30 ).
cnf(c_0_42,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_43,negated_conjecture,
cons(sk5,sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_44,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_36 ).
cnf(c_0_45,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
c_0_37 ).
cnf(c_0_46,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_38 ).
cnf(c_0_47,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_48,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_49,negated_conjecture,
( app(tl(sk1),cons(hd(sk1),nil)) != sk2
| ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ ssItem(hd(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_24]),c_0_25])])])])])]),c_0_41]) ).
cnf(c_0_50,negated_conjecture,
tl(sk1) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_34]),c_0_35])]) ).
cnf(c_0_51,negated_conjecture,
hd(sk1) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_43]),c_0_34]),c_0_35])]) ).
cnf(c_0_52,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_24]),c_0_24]),c_0_25])]) ).
cnf(c_0_53,negated_conjecture,
( X1 = sk1
| neq(sk1,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,axiom,
ssList(nil),
clause8 ).
cnf(c_0_55,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_43]),c_0_34]),c_0_35])]) ).
cnf(c_0_56,negated_conjecture,
( ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_50]),c_0_35])]),c_0_51]),c_0_52]),c_0_51]),c_0_34]),c_0_51])]) ).
cnf(c_0_57,negated_conjecture,
neq(sk1,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_58,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( ~ neq(nil,sk1)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]) ).
cnf(c_0_60,negated_conjecture,
neq(nil,sk1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_47]),c_0_55]) ).
cnf(c_0_61,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_62,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_63,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_61 ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_34]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC316-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.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:04:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.51 Running first-order theorem proving
% 0.19/0.51 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.53/0.55 # Version: 3.1.0
% 0.53/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.53/0.55 # Starting sh5l with 300s (1) cores
% 0.53/0.55 # new_bool_3 with pid 2681 completed with status 0
% 0.53/0.55 # Result found by new_bool_3
% 0.53/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.53/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.53/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2684 completed with status 0
% 0.53/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.53/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.53/0.55 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.53/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.53/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.53/0.55 # Preprocessing time : 0.002 s
% 0.53/0.55 # Presaturation interreduction done
% 0.53/0.55
% 0.53/0.55 # Proof found!
% 0.53/0.55 # SZS status Unsatisfiable
% 0.53/0.55 # SZS output start CNFRefutation
% See solution above
% 0.53/0.55 # Parsed axioms : 203
% 0.53/0.55 # Removed by relevancy pruning/SinE : 129
% 0.53/0.55 # Initial clauses : 74
% 0.53/0.55 # Removed in clause preprocessing : 0
% 0.53/0.55 # Initial clauses in saturation : 74
% 0.53/0.55 # Processed clauses : 220
% 0.53/0.55 # ...of these trivial : 11
% 0.53/0.55 # ...subsumed : 17
% 0.53/0.55 # ...remaining for further processing : 192
% 0.53/0.55 # Other redundant clauses eliminated : 17
% 0.53/0.55 # Clauses deleted for lack of memory : 0
% 0.53/0.55 # Backward-subsumed : 7
% 0.53/0.55 # Backward-rewritten : 6
% 0.53/0.55 # Generated clauses : 360
% 0.53/0.55 # ...of the previous two non-redundant : 324
% 0.53/0.55 # ...aggressively subsumed : 0
% 0.53/0.55 # Contextual simplify-reflections : 4
% 0.53/0.55 # Paramodulations : 339
% 0.53/0.55 # Factorizations : 0
% 0.53/0.55 # NegExts : 0
% 0.53/0.55 # Equation resolutions : 21
% 0.53/0.55 # Disequality decompositions : 0
% 0.53/0.55 # Total rewrite steps : 265
% 0.53/0.55 # ...of those cached : 245
% 0.53/0.55 # Propositional unsat checks : 0
% 0.53/0.55 # Propositional check models : 0
% 0.53/0.55 # Propositional check unsatisfiable : 0
% 0.53/0.55 # Propositional clauses : 0
% 0.53/0.55 # Propositional clauses after purity: 0
% 0.53/0.55 # Propositional unsat core size : 0
% 0.53/0.55 # Propositional preprocessing time : 0.000
% 0.53/0.55 # Propositional encoding time : 0.000
% 0.53/0.55 # Propositional solver time : 0.000
% 0.53/0.55 # Success case prop preproc time : 0.000
% 0.53/0.55 # Success case prop encoding time : 0.000
% 0.53/0.55 # Success case prop solver time : 0.000
% 0.53/0.55 # Current number of processed clauses : 106
% 0.53/0.55 # Positive orientable unit clauses : 26
% 0.53/0.55 # Positive unorientable unit clauses: 0
% 0.53/0.55 # Negative unit clauses : 5
% 0.53/0.55 # Non-unit-clauses : 75
% 0.53/0.55 # Current number of unprocessed clauses: 223
% 0.53/0.55 # ...number of literals in the above : 1080
% 0.53/0.55 # Current number of archived formulas : 0
% 0.53/0.55 # Current number of archived clauses : 77
% 0.53/0.55 # Clause-clause subsumption calls (NU) : 1852
% 0.53/0.55 # Rec. Clause-clause subsumption calls : 372
% 0.53/0.55 # Non-unit clause-clause subsumptions : 17
% 0.53/0.55 # Unit Clause-clause subsumption calls : 198
% 0.53/0.55 # Rewrite failures with RHS unbound : 0
% 0.53/0.55 # BW rewrite match attempts : 4
% 0.53/0.55 # BW rewrite match successes : 4
% 0.53/0.55 # Condensation attempts : 0
% 0.53/0.55 # Condensation successes : 0
% 0.53/0.55 # Termbank termtop insertions : 10226
% 0.53/0.55 # Search garbage collected termcells : 885
% 0.53/0.55
% 0.53/0.55 # -------------------------------------------------
% 0.53/0.55 # User time : 0.020 s
% 0.53/0.55 # System time : 0.003 s
% 0.53/0.55 # Total time : 0.024 s
% 0.53/0.55 # Maximum resident set size: 2124 pages
% 0.53/0.55
% 0.53/0.55 # -------------------------------------------------
% 0.53/0.55 # User time : 0.027 s
% 0.53/0.55 # System time : 0.007 s
% 0.53/0.55 # Total time : 0.034 s
% 0.53/0.55 # Maximum resident set size: 1880 pages
% 0.53/0.55 % E---3.1 exiting
% 0.53/0.55 % E exiting
%------------------------------------------------------------------------------