TSTP Solution File: SWC311-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC311-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:28:59 EDT 2024
% Result : Unsatisfiable 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of clauses : 63 ( 12 unt; 19 nHn; 63 RR)
% Number of literals : 208 ( 86 equ; 130 neg)
% Maximal clause size : 12 ( 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 : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
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(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_9,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_10,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_11,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(c_0_17,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_18,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_17 ).
cnf(c_0_19,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_20,negated_conjecture,
( sk3 = X1
| tl(sk4) != X2
| hd(sk4) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_24,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_25,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ 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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_22]),c_0_22]),c_0_22])])])])]),c_0_23]) ).
cnf(c_0_26,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_24 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_29,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
co1_9 ).
cnf(c_0_30,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_31,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_32,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_30 ).
cnf(c_0_33,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_34,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28])]) ).
cnf(c_0_35,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_33 ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_37,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssList(cons(hd(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28])]) ).
cnf(c_0_38,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_40,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil
| ~ ssItem(hd(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_27])]) ).
cnf(c_0_41,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
c_0_39 ).
cnf(c_0_42,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_32]),c_0_28])]) ).
cnf(c_0_43,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_44,negated_conjecture,
( sk2 = nil
| app(cons(hd(sk2),nil),tl(sk2)) != sk2
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_43 ).
cnf(c_0_46,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_47,negated_conjecture,
( sk2 = nil
| cons(hd(sk2),tl(sk2)) != sk2
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_46 ).
cnf(c_0_49,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_50,negated_conjecture,
( sk2 = nil
| ~ ssItem(hd(sk2))
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_28])]) ).
cnf(c_0_51,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_49 ).
cnf(c_0_52,negated_conjecture,
( sk2 = nil
| ~ ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_32]),c_0_28])]) ).
cnf(c_0_53,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_54,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_55,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_21]),c_0_22]) ).
cnf(c_0_56,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_35]),c_0_28])]) ).
cnf(c_0_57,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_53 ).
cnf(c_0_58,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
c_0_54 ).
cnf(c_0_59,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_60,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_61,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_56]),c_0_59])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWC311-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.08 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n024.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 03:41:37 EDT 2024
% 0.07/0.26 % CPUTime :
% 0.11/0.33 Running first-order model finding
% 0.11/0.33 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 # Version: 3.1.0
% 0.11/0.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.36 # Starting sh5l with 300s (1) cores
% 0.11/0.36 # sh5l with pid 17937 completed with status 0
% 0.11/0.36 # Result found by sh5l
% 0.11/0.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.36 # Starting sh5l with 300s (1) cores
% 0.11/0.36 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.36 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.11/0.36 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.11/0.36 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 17945 completed with status 0
% 0.11/0.36 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.11/0.36 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.36 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.36 # Starting sh5l with 300s (1) cores
% 0.11/0.36 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.36 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.11/0.36 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.36 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.11/0.36 # Preprocessing time : 0.002 s
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36
% 0.11/0.36 # Proof found!
% 0.11/0.36 # SZS status Unsatisfiable
% 0.11/0.36 # SZS output start CNFRefutation
% See solution above
% 0.11/0.36 # Parsed axioms : 197
% 0.11/0.36 # Removed by relevancy pruning/SinE : 30
% 0.11/0.36 # Initial clauses : 167
% 0.11/0.36 # Removed in clause preprocessing : 0
% 0.11/0.36 # Initial clauses in saturation : 167
% 0.11/0.36 # Processed clauses : 337
% 0.11/0.36 # ...of these trivial : 2
% 0.11/0.36 # ...subsumed : 11
% 0.11/0.36 # ...remaining for further processing : 324
% 0.11/0.36 # Other redundant clauses eliminated : 35
% 0.11/0.36 # Clauses deleted for lack of memory : 0
% 0.11/0.36 # Backward-subsumed : 14
% 0.11/0.36 # Backward-rewritten : 15
% 0.11/0.36 # Generated clauses : 143
% 0.11/0.36 # ...of the previous two non-redundant : 120
% 0.11/0.36 # ...aggressively subsumed : 0
% 0.11/0.36 # Contextual simplify-reflections : 6
% 0.11/0.36 # Paramodulations : 107
% 0.11/0.36 # Factorizations : 0
% 0.11/0.36 # NegExts : 0
% 0.11/0.36 # Equation resolutions : 40
% 0.11/0.36 # Disequality decompositions : 0
% 0.11/0.36 # Total rewrite steps : 108
% 0.11/0.36 # ...of those cached : 99
% 0.11/0.36 # Propositional unsat checks : 0
% 0.11/0.36 # Propositional check models : 0
% 0.11/0.36 # Propositional check unsatisfiable : 0
% 0.11/0.36 # Propositional clauses : 0
% 0.11/0.36 # Propositional clauses after purity: 0
% 0.11/0.36 # Propositional unsat core size : 0
% 0.11/0.36 # Propositional preprocessing time : 0.000
% 0.11/0.36 # Propositional encoding time : 0.000
% 0.11/0.36 # Propositional solver time : 0.000
% 0.11/0.36 # Success case prop preproc time : 0.000
% 0.11/0.36 # Success case prop encoding time : 0.000
% 0.11/0.36 # Success case prop solver time : 0.000
% 0.11/0.36 # Current number of processed clauses : 115
% 0.11/0.36 # Positive orientable unit clauses : 45
% 0.11/0.36 # Positive unorientable unit clauses: 0
% 0.11/0.36 # Negative unit clauses : 0
% 0.11/0.36 # Non-unit-clauses : 70
% 0.11/0.36 # Current number of unprocessed clauses: 109
% 0.11/0.36 # ...number of literals in the above : 563
% 0.11/0.36 # Current number of archived formulas : 0
% 0.11/0.36 # Current number of archived clauses : 188
% 0.11/0.36 # Clause-clause subsumption calls (NU) : 9188
% 0.11/0.36 # Rec. Clause-clause subsumption calls : 1340
% 0.11/0.36 # Non-unit clause-clause subsumptions : 31
% 0.11/0.36 # Unit Clause-clause subsumption calls : 98
% 0.11/0.36 # Rewrite failures with RHS unbound : 0
% 0.11/0.36 # BW rewrite match attempts : 2
% 0.11/0.36 # BW rewrite match successes : 2
% 0.11/0.36 # Condensation attempts : 0
% 0.11/0.36 # Condensation successes : 0
% 0.11/0.36 # Termbank termtop insertions : 10469
% 0.11/0.36 # Search garbage collected termcells : 643
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.016 s
% 0.11/0.36 # System time : 0.002 s
% 0.11/0.36 # Total time : 0.018 s
% 0.11/0.36 # Maximum resident set size: 2216 pages
% 0.11/0.36
% 0.11/0.36 # -------------------------------------------------
% 0.11/0.36 # User time : 0.019 s
% 0.11/0.36 # System time : 0.003 s
% 0.11/0.36 # Total time : 0.021 s
% 0.11/0.36 # Maximum resident set size: 1876 pages
% 0.11/0.36 % E---3.1 exiting
%------------------------------------------------------------------------------