TSTP Solution File: SWC083-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC083-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:23:09 EDT 2024
% Result : Unsatisfiable 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of clauses : 63 ( 33 unt; 3 nHn; 63 RR)
% Number of literals : 129 ( 30 equ; 68 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_12,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_13,negated_conjecture,
app(sk5,sk7) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_11,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_9,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_10,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_18,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_19,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_18 ).
cnf(c_0_20,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
co1_12 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
app(sk5,sk7) = sk4,
co1_13 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_25,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_26,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_19]) ).
cnf(c_0_27,negated_conjecture,
app(app(sk5,sk6),sk7) = sk1,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk7),
co1_11 ).
cnf(c_0_29,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_30,negated_conjecture,
app(sk5,sk7) = sk2,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk5),
co1_9 ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_24 ).
cnf(c_0_33,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_25 ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
cnf(c_0_35,negated_conjecture,
( segmentP(app(sk1,X1),sk7)
| ~ ssList(app(sk5,sk6))
| ~ ssList(app(sk1,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_36,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_29 ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,negated_conjecture,
( segmentP(app(sk2,X1),sk7)
| ~ ssList(app(sk2,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_30]),c_0_28]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_40,negated_conjecture,
( nil = X1
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_41,negated_conjecture,
( segmentP(sk1,sk7)
| ~ ssList(app(sk5,sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_34])]) ).
cnf(c_0_42,negated_conjecture,
segmentP(sk2,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_36]),c_0_39]),c_0_34])]) ).
cnf(c_0_43,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_44,negated_conjecture,
( sk7 = nil
| ~ ssList(app(sk5,sk6)) ),
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_28])]) ).
cnf(c_0_45,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_43 ).
cnf(c_0_46,negated_conjecture,
ssList(sk6),
co1_10 ).
cnf(c_0_47,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_31]),c_0_46])]) ).
cnf(c_0_48,negated_conjecture,
app(sk5,nil) = sk2,
inference(rw,[status(thm)],[c_0_30,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
sk5 = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_48]),c_0_31])]) ).
cnf(c_0_50,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_51,negated_conjecture,
app(app(sk2,sk6),nil) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_47]),c_0_49]) ).
cnf(c_0_52,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_53,negated_conjecture,
( app(sk2,sk6) = sk1
| ~ ssList(app(sk2,sk6)) ),
inference(spm,[status(thm)],[c_0_36,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_55,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_52]),c_0_34])]),c_0_45]) ).
cnf(c_0_56,negated_conjecture,
app(sk2,sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_45]),c_0_39]),c_0_46])]) ).
cnf(c_0_57,negated_conjecture,
( ~ segmentP(sk1,sk2)
| ~ segmentP(sk2,sk2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_54]),c_0_39])]) ).
cnf(c_0_58,negated_conjecture,
segmentP(sk1,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_46]),c_0_39])]) ).
cnf(c_0_59,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_60,negated_conjecture,
~ segmentP(sk2,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_61,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
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_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : SWC083-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 300
% 0.10/0.28 % DateTime : Sun May 19 02:36:37 EDT 2024
% 0.10/0.28 % CPUTime :
% 0.14/0.37 Running first-order theorem proving
% 0.14/0.37 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.14/0.47 # Version: 3.1.0
% 0.14/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 # Starting sh5l with 300s (1) cores
% 0.14/0.47 # new_bool_3 with pid 11752 completed with status 0
% 0.14/0.47 # Result found by new_bool_3
% 0.14/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.14/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.47 # SAT001_MinMin_p005000_rr_RG with pid 11755 completed with status 0
% 0.14/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.47 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.14/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.47 # Preprocessing time : 0.002 s
% 0.14/0.47 # Presaturation interreduction done
% 0.14/0.47
% 0.14/0.47 # Proof found!
% 0.14/0.47 # SZS status Unsatisfiable
% 0.14/0.47 # SZS output start CNFRefutation
% See solution above
% 0.14/0.47 # Parsed axioms : 198
% 0.14/0.47 # Removed by relevancy pruning/SinE : 156
% 0.14/0.47 # Initial clauses : 42
% 0.14/0.47 # Removed in clause preprocessing : 0
% 0.14/0.47 # Initial clauses in saturation : 42
% 0.14/0.47 # Processed clauses : 1758
% 0.14/0.47 # ...of these trivial : 75
% 0.14/0.47 # ...subsumed : 1111
% 0.14/0.47 # ...remaining for further processing : 572
% 0.14/0.47 # Other redundant clauses eliminated : 13
% 0.14/0.47 # Clauses deleted for lack of memory : 0
% 0.14/0.47 # Backward-subsumed : 268
% 0.14/0.47 # Backward-rewritten : 86
% 0.14/0.47 # Generated clauses : 6312
% 0.14/0.47 # ...of the previous two non-redundant : 5739
% 0.14/0.47 # ...aggressively subsumed : 0
% 0.14/0.47 # Contextual simplify-reflections : 37
% 0.14/0.47 # Paramodulations : 6296
% 0.14/0.47 # Factorizations : 0
% 0.14/0.47 # NegExts : 0
% 0.14/0.47 # Equation resolutions : 17
% 0.14/0.47 # Disequality decompositions : 0
% 0.14/0.47 # Total rewrite steps : 7330
% 0.14/0.47 # ...of those cached : 7302
% 0.14/0.47 # Propositional unsat checks : 0
% 0.14/0.47 # Propositional check models : 0
% 0.14/0.47 # Propositional check unsatisfiable : 0
% 0.14/0.47 # Propositional clauses : 0
% 0.14/0.47 # Propositional clauses after purity: 0
% 0.14/0.47 # Propositional unsat core size : 0
% 0.14/0.47 # Propositional preprocessing time : 0.000
% 0.14/0.47 # Propositional encoding time : 0.000
% 0.14/0.47 # Propositional solver time : 0.000
% 0.14/0.47 # Success case prop preproc time : 0.000
% 0.14/0.47 # Success case prop encoding time : 0.000
% 0.14/0.47 # Success case prop solver time : 0.000
% 0.14/0.47 # Current number of processed clauses : 173
% 0.14/0.47 # Positive orientable unit clauses : 23
% 0.14/0.47 # Positive unorientable unit clauses: 0
% 0.14/0.47 # Negative unit clauses : 9
% 0.14/0.47 # Non-unit-clauses : 141
% 0.14/0.47 # Current number of unprocessed clauses: 3490
% 0.14/0.47 # ...number of literals in the above : 18327
% 0.14/0.47 # Current number of archived formulas : 0
% 0.14/0.47 # Current number of archived clauses : 394
% 0.14/0.47 # Clause-clause subsumption calls (NU) : 32132
% 0.14/0.47 # Rec. Clause-clause subsumption calls : 10519
% 0.14/0.47 # Non-unit clause-clause subsumptions : 1083
% 0.14/0.47 # Unit Clause-clause subsumption calls : 528
% 0.14/0.47 # Rewrite failures with RHS unbound : 0
% 0.14/0.47 # BW rewrite match attempts : 14
% 0.14/0.47 # BW rewrite match successes : 14
% 0.14/0.47 # Condensation attempts : 0
% 0.14/0.47 # Condensation successes : 0
% 0.14/0.47 # Termbank termtop insertions : 99982
% 0.14/0.47 # Search garbage collected termcells : 911
% 0.14/0.47
% 0.14/0.47 # -------------------------------------------------
% 0.14/0.47 # User time : 0.082 s
% 0.14/0.47 # System time : 0.003 s
% 0.14/0.47 # Total time : 0.085 s
% 0.14/0.47 # Maximum resident set size: 2068 pages
% 0.14/0.47
% 0.14/0.47 # -------------------------------------------------
% 0.14/0.47 # User time : 0.085 s
% 0.14/0.47 # System time : 0.003 s
% 0.14/0.47 # Total time : 0.088 s
% 0.14/0.47 # Maximum resident set size: 1876 pages
% 0.14/0.47 % E---3.1 exiting
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------