TSTP Solution File: SWC330-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC330-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:29:05 EDT 2024
% Result : Unsatisfiable 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 52 ( 18 unt; 15 nHn; 52 RR)
% Number of literals : 107 ( 39 equ; 47 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_21,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_21) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
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(co1_17,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_18,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause1) ).
cnf(c_0_18,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_19,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_20,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_21,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_26,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_27,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_28,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ equalelemsP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( sk3 = nil
| equalelemsP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_27 ).
cnf(c_0_34,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_37,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_28]) ).
cnf(c_0_38,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
co1_18 ).
cnf(c_0_39,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_41,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
co1_15 ).
cnf(c_0_42,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_16 ).
cnf(c_0_43,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_44,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_45,negated_conjecture,
( sk4 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_36]) ).
cnf(c_0_46,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_37,c_0_38]),c_0_39]),c_0_40])]),c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_48,axiom,
equalelemsP(nil),
clause1 ).
cnf(c_0_49,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_50,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_47]),c_0_35])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[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_31,c_0_46]),c_0_46]),c_0_48])]),c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWC330-1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 02:45:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.49 Running first-order model finding
% 0.23/0.49 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.23/0.53 # Version: 3.1.0
% 0.23/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 # Starting sh5l with 300s (1) cores
% 0.23/0.53 # new_bool_3 with pid 19570 completed with status 0
% 0.23/0.53 # Result found by new_bool_3
% 0.23/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.23/0.53 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19573 completed with status 0
% 0.23/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.53 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.23/0.53 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.23/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.23/0.53 # Preprocessing time : 0.003 s
% 0.23/0.53 # Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 # Proof found!
% 0.23/0.53 # SZS status Unsatisfiable
% 0.23/0.53 # SZS output start CNFRefutation
% See solution above
% 0.23/0.53 # Parsed axioms : 206
% 0.23/0.53 # Removed by relevancy pruning/SinE : 138
% 0.23/0.53 # Initial clauses : 68
% 0.23/0.53 # Removed in clause preprocessing : 0
% 0.23/0.53 # Initial clauses in saturation : 68
% 0.23/0.53 # Processed clauses : 184
% 0.23/0.53 # ...of these trivial : 4
% 0.23/0.53 # ...subsumed : 10
% 0.23/0.53 # ...remaining for further processing : 169
% 0.23/0.53 # Other redundant clauses eliminated : 12
% 0.23/0.53 # Clauses deleted for lack of memory : 0
% 0.23/0.53 # Backward-subsumed : 0
% 0.23/0.53 # Backward-rewritten : 48
% 0.23/0.53 # Generated clauses : 289
% 0.23/0.53 # ...of the previous two non-redundant : 244
% 0.23/0.53 # ...aggressively subsumed : 0
% 0.23/0.53 # Contextual simplify-reflections : 28
% 0.23/0.53 # Paramodulations : 274
% 0.23/0.53 # Factorizations : 0
% 0.23/0.53 # NegExts : 0
% 0.23/0.53 # Equation resolutions : 16
% 0.23/0.53 # Disequality decompositions : 0
% 0.23/0.53 # Total rewrite steps : 270
% 0.23/0.53 # ...of those cached : 260
% 0.23/0.53 # Propositional unsat checks : 0
% 0.23/0.53 # Propositional check models : 0
% 0.23/0.53 # Propositional check unsatisfiable : 0
% 0.23/0.53 # Propositional clauses : 0
% 0.23/0.53 # Propositional clauses after purity: 0
% 0.23/0.53 # Propositional unsat core size : 0
% 0.23/0.53 # Propositional preprocessing time : 0.000
% 0.23/0.53 # Propositional encoding time : 0.000
% 0.23/0.53 # Propositional solver time : 0.000
% 0.23/0.53 # Success case prop preproc time : 0.000
% 0.23/0.53 # Success case prop encoding time : 0.000
% 0.23/0.53 # Success case prop solver time : 0.000
% 0.23/0.53 # Current number of processed clauses : 50
% 0.23/0.53 # Positive orientable unit clauses : 8
% 0.23/0.53 # Positive unorientable unit clauses: 0
% 0.23/0.53 # Negative unit clauses : 0
% 0.23/0.53 # Non-unit-clauses : 42
% 0.23/0.53 # Current number of unprocessed clauses: 192
% 0.23/0.53 # ...number of literals in the above : 1049
% 0.23/0.53 # Current number of archived formulas : 0
% 0.23/0.53 # Current number of archived clauses : 112
% 0.23/0.53 # Clause-clause subsumption calls (NU) : 1563
% 0.23/0.53 # Rec. Clause-clause subsumption calls : 475
% 0.23/0.53 # Non-unit clause-clause subsumptions : 38
% 0.23/0.53 # Unit Clause-clause subsumption calls : 10
% 0.23/0.53 # Rewrite failures with RHS unbound : 0
% 0.23/0.53 # BW rewrite match attempts : 2
% 0.23/0.53 # BW rewrite match successes : 2
% 0.23/0.53 # Condensation attempts : 0
% 0.23/0.53 # Condensation successes : 0
% 0.23/0.53 # Termbank termtop insertions : 8853
% 0.23/0.53 # Search garbage collected termcells : 889
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.015 s
% 0.23/0.53 # System time : 0.006 s
% 0.23/0.53 # Total time : 0.021 s
% 0.23/0.53 # Maximum resident set size: 2112 pages
% 0.23/0.53
% 0.23/0.53 # -------------------------------------------------
% 0.23/0.53 # User time : 0.018 s
% 0.23/0.53 # System time : 0.009 s
% 0.23/0.53 # Total time : 0.027 s
% 0.23/0.53 # Maximum resident set size: 1880 pages
% 0.23/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------