TSTP Solution File: SWC389-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC389-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:26:18 EDT 2024
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of clauses : 60 ( 15 unt; 15 nHn; 60 RR)
% Number of literals : 140 ( 46 equ; 77 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 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 : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_21,negated_conjecture,
( neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_22,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_17,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(co1_18,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(c_0_19,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_20,negated_conjecture,
( neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_21,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_22,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_22]) ).
cnf(c_0_23,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_27,negated_conjecture,
( neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_29,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_21 ).
cnf(c_0_30,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_33,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_34,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ singletonP(sk1) ),
c_0_22 ).
cnf(c_0_35,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_36,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_37,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_39,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_26 ).
cnf(c_0_40,negated_conjecture,
( neq(sk4,nil)
| ~ segmentP(sk4,sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]),c_0_25]) ).
cnf(c_0_41,negated_conjecture,
( sk4 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_42,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_33 ).
cnf(c_0_43,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_44,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ singletonP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_25]),c_0_28]),c_0_25]) ).
cnf(c_0_45,negated_conjecture,
( sk3 = nil
| singletonP(sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_46,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_47,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( neq(nil,nil)
| sk3 != nil
| ~ segmentP(nil,sk3) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
co1_18 ).
cnf(c_0_51,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_43,c_0_28]) ).
cnf(c_0_52,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
co1_15 ).
cnf(c_0_53,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_16 ).
cnf(c_0_54,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_55,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_46 ).
cnf(c_0_56,negated_conjecture,
( sk3 != nil
| ~ segmentP(nil,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_31])]) ).
cnf(c_0_57,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_37])]),c_0_52]),c_0_53]),c_0_54]) ).
cnf(c_0_58,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_55]),c_0_31])]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_57]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC389-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 03:06:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.22/0.54 # Version: 3.1.0
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # new_bool_3 with pid 18560 completed with status 0
% 0.22/0.54 # Result found by new_bool_3
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.54 # SAT001_MinMin_p005000_rr_RG with pid 18563 completed with status 0
% 0.22/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.54 # Preprocessing time : 0.002 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 207
% 0.22/0.54 # Removed by relevancy pruning/SinE : 135
% 0.22/0.54 # Initial clauses : 72
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 72
% 0.22/0.54 # Processed clauses : 227
% 0.22/0.54 # ...of these trivial : 2
% 0.22/0.54 # ...subsumed : 34
% 0.22/0.54 # ...remaining for further processing : 191
% 0.22/0.54 # Other redundant clauses eliminated : 14
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 8
% 0.22/0.54 # Backward-rewritten : 38
% 0.22/0.54 # Generated clauses : 366
% 0.22/0.54 # ...of the previous two non-redundant : 279
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 32
% 0.22/0.54 # Paramodulations : 349
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 18
% 0.22/0.54 # Disequality decompositions : 0
% 0.22/0.54 # Total rewrite steps : 313
% 0.22/0.54 # ...of those cached : 305
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 68
% 0.22/0.54 # Positive orientable unit clauses : 6
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 1
% 0.22/0.54 # Non-unit-clauses : 61
% 0.22/0.54 # Current number of unprocessed clauses: 176
% 0.22/0.54 # ...number of literals in the above : 971
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 114
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 2291
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 539
% 0.22/0.54 # Non-unit clause-clause subsumptions : 74
% 0.22/0.54 # Unit Clause-clause subsumption calls : 3
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 1
% 0.22/0.54 # BW rewrite match successes : 1
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 10138
% 0.22/0.54 # Search garbage collected termcells : 891
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.021 s
% 0.22/0.54 # System time : 0.004 s
% 0.22/0.54 # Total time : 0.024 s
% 0.22/0.54 # Maximum resident set size: 2092 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.024 s
% 0.22/0.54 # System time : 0.007 s
% 0.22/0.54 # Total time : 0.031 s
% 0.22/0.54 # Maximum resident set size: 1880 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------