TSTP Solution File: SWC207-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC207-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:24:23 EDT 2024
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 20 unt; 7 nHn; 31 RR)
% Number of literals : 51 ( 20 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 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 : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
~ neq(sk1,nil),
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_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
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_9,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(c_0_10,negated_conjecture,
~ neq(sk1,nil),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_11,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_12,negated_conjecture,
~ neq(sk1,nil),
c_0_10 ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_14,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_15,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_16,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_18,axiom,
ssList(nil),
clause8 ).
cnf(c_0_19,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_9 ).
cnf(c_0_20,negated_conjecture,
~ neq(sk3,nil),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
( sk4 = nil
| sk3 != nil ),
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,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_18])]) ).
cnf(c_0_27,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC207-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n007.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 02:51:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 4138 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 4141 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.004 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Unsatisfiable
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 201
% 0.21/0.52 # Removed by relevancy pruning/SinE : 145
% 0.21/0.52 # Initial clauses : 56
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 56
% 0.21/0.52 # Processed clauses : 97
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 3
% 0.21/0.52 # ...remaining for further processing : 92
% 0.21/0.52 # Other redundant clauses eliminated : 7
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 15
% 0.21/0.52 # Generated clauses : 14
% 0.21/0.52 # ...of the previous two non-redundant : 13
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 1
% 0.21/0.52 # Paramodulations : 8
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 7
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 35
% 0.21/0.52 # ...of those cached : 28
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 19
% 0.21/0.52 # Positive orientable unit clauses : 4
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 1
% 0.21/0.52 # Non-unit-clauses : 14
% 0.21/0.52 # Current number of unprocessed clauses: 24
% 0.21/0.52 # ...number of literals in the above : 110
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 67
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 679
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 99
% 0.21/0.52 # Non-unit clause-clause subsumptions : 4
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 2
% 0.21/0.52 # BW rewrite match successes : 2
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3984
% 0.21/0.52 # Search garbage collected termcells : 894
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.007 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 2068 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.012 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.018 s
% 0.21/0.52 # Maximum resident set size: 1876 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------