TSTP Solution File: SWC355-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC355-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:01 EDT 2024
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 41 ( 14 unt; 1 nHn; 41 RR)
% Number of literals : 89 ( 11 equ; 52 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_13,negated_conjecture,
( app(sk3,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(co1_14,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_12,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_13,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_14,negated_conjecture,
( app(sk3,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_15,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_16,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_17,plain,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_12 ).
cnf(c_0_18,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_13 ).
cnf(c_0_19,axiom,
ssList(nil),
clause8 ).
cnf(c_0_20,negated_conjecture,
( app(sk3,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
c_0_14 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
neq(sk2,nil),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
c_0_16 ).
cnf(c_0_25,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_26,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
app(sk1,cons(sk5,nil)) = sk2,
inference(cn,[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_23])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_30,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
c_0_25 ).
cnf(c_0_32,negated_conjecture,
( segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ ssList(cons(sk5,nil))
| ~ 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_33,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_23])]) ).
cnf(c_0_35,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
inference(rw,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_37,negated_conjecture,
( segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ ssList(X1) ),
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_19])]) ).
cnf(c_0_38,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
~ segmentP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_23])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_28])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC355-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.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 02:48:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.47 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.19/0.54 # Version: 3.1.0
% 0.19/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # new_bool_3 with pid 21223 completed with status 0
% 0.19/0.54 # Result found by new_bool_3
% 0.19/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.19/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.54 # SAT001_MinMin_p005000_rr_RG with pid 21226 completed with status 0
% 0.19/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.19/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.54 # Preprocessing time : 0.002 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Unsatisfiable
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 199
% 0.19/0.54 # Removed by relevancy pruning/SinE : 156
% 0.19/0.54 # Initial clauses : 43
% 0.19/0.54 # Removed in clause preprocessing : 0
% 0.19/0.54 # Initial clauses in saturation : 43
% 0.19/0.54 # Processed clauses : 643
% 0.19/0.54 # ...of these trivial : 10
% 0.19/0.54 # ...subsumed : 370
% 0.19/0.54 # ...remaining for further processing : 263
% 0.19/0.54 # Other redundant clauses eliminated : 13
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 42
% 0.19/0.54 # Backward-rewritten : 17
% 0.19/0.54 # Generated clauses : 2001
% 0.19/0.54 # ...of the previous two non-redundant : 1820
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 40
% 0.19/0.54 # Paramodulations : 1985
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 17
% 0.19/0.54 # Disequality decompositions : 0
% 0.19/0.54 # Total rewrite steps : 1850
% 0.19/0.54 # ...of those cached : 1838
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 162
% 0.19/0.54 # Positive orientable unit clauses : 14
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 8
% 0.19/0.54 # Non-unit-clauses : 140
% 0.19/0.54 # Current number of unprocessed clauses: 1174
% 0.19/0.54 # ...number of literals in the above : 6898
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 96
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 6203
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 1875
% 0.19/0.54 # Non-unit clause-clause subsumptions : 372
% 0.19/0.54 # Unit Clause-clause subsumption calls : 160
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 4
% 0.19/0.54 # BW rewrite match successes : 4
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 37525
% 0.19/0.54 # Search garbage collected termcells : 911
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.057 s
% 0.19/0.54 # System time : 0.001 s
% 0.19/0.54 # Total time : 0.058 s
% 0.19/0.54 # Maximum resident set size: 1936 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.061 s
% 0.19/0.54 # System time : 0.004 s
% 0.19/0.54 # Total time : 0.064 s
% 0.19/0.54 # Maximum resident set size: 1872 pages
% 0.19/0.54 % E---3.1 exiting
% 0.19/0.54 % E exiting
%------------------------------------------------------------------------------