TSTP Solution File: SWC331-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC331-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:25:47 EDT 2024
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 31 RR)
% Number of literals : 64 ( 12 equ; 37 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 26 ( 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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_12,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_11,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_12,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_11 ).
cnf(c_0_13,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_14,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_15,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_16,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_12]) ).
cnf(c_0_17,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_13 ).
cnf(c_0_18,axiom,
ssList(nil),
clause8 ).
cnf(c_0_19,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
c_0_15 ).
cnf(c_0_23,negated_conjecture,
equalelemsP(sk3),
co1_9 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,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_16,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_27,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_28,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_21]),c_0_23]),c_0_24]),c_0_21])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[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]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC331-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 03:46:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.43 Running first-order theorem proving
% 0.18/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # new_bool_1 with pid 13763 completed with status 0
% 0.18/0.49 # Result found by new_bool_1
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FHHSF-FFMM22-MFFFFFNN
% 0.18/0.49 # partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.49 # SAT001_MinMin_p005000_rr_RG with pid 13766 completed with status 0
% 0.18/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.49 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.49 # Search class: FHHSF-FFMM22-MFFFFFNN
% 0.18/0.49 # partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.18/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.49 # Preprocessing time : 0.001 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Unsatisfiable
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 197
% 0.18/0.49 # Removed by relevancy pruning/SinE : 157
% 0.18/0.49 # Initial clauses : 40
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 40
% 0.18/0.49 # Processed clauses : 831
% 0.18/0.49 # ...of these trivial : 21
% 0.18/0.49 # ...subsumed : 482
% 0.18/0.49 # ...remaining for further processing : 328
% 0.18/0.49 # Other redundant clauses eliminated : 12
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 42
% 0.18/0.49 # Backward-rewritten : 18
% 0.18/0.49 # Generated clauses : 2791
% 0.18/0.49 # ...of the previous two non-redundant : 2479
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 51
% 0.18/0.49 # Paramodulations : 2778
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 14
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 2772
% 0.18/0.49 # ...of those cached : 2756
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 226
% 0.18/0.49 # Positive orientable unit clauses : 17
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 12
% 0.18/0.49 # Non-unit-clauses : 197
% 0.18/0.49 # Current number of unprocessed clauses: 1663
% 0.18/0.49 # ...number of literals in the above : 9514
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 98
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 13064
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 3528
% 0.18/0.49 # Non-unit clause-clause subsumptions : 462
% 0.18/0.49 # Unit Clause-clause subsumption calls : 810
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 5
% 0.18/0.49 # BW rewrite match successes : 5
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 50226
% 0.18/0.49 # Search garbage collected termcells : 916
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.038 s
% 0.18/0.49 # System time : 0.004 s
% 0.18/0.49 # Total time : 0.043 s
% 0.18/0.49 # Maximum resident set size: 2088 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.042 s
% 0.18/0.49 # System time : 0.007 s
% 0.18/0.49 # Total time : 0.049 s
% 0.18/0.49 # Maximum resident set size: 1876 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------