TSTP Solution File: SWC098-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC098-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:19 EDT 2024
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 52 ( 15 unt; 13 nHn; 52 RR)
% Number of literals : 135 ( 59 equ; 83 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
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_9,negated_conjecture,
( leq(X1,sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_14,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk6)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_8,negated_conjecture,
( memberP(sk2,sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_10,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != sk1
| X1 != sk5(X1)
| ~ memberP(sk2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_19,negated_conjecture,
( sk6 = X1
| nil = sk3
| ~ ssItem(X1)
| ~ memberP(sk4,X1)
| ~ leq(sk6,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_17,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_18,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(c_0_15,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_16,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_17,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
( leq(X1,sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_21,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk4 ),
co1_14 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,negated_conjecture,
( ssItem(sk6)
| nil = sk4 ),
co1_12 ).
cnf(c_0_25,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( memberP(sk2,sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != sk1
| X1 != sk5(X1)
| ~ memberP(sk2,X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_29,negated_conjecture,
( sk6 = X1
| nil = sk3
| ~ ssItem(X1)
| ~ memberP(sk4,X1)
| ~ leq(sk6,X1) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_30,negated_conjecture,
( leq(X1,sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
c_0_20 ).
cnf(c_0_31,negated_conjecture,
( cons(sk6,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_32,negated_conjecture,
sk3 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( memberP(sk4,sk6)
| nil = sk3 ),
co1_18 ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_13 ).
cnf(c_0_35,negated_conjecture,
( memberP(sk2,sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
c_0_26 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5(X1))
| ~ ssItem(X1)
| cons(X1,nil) != sk1
| ~ memberP(sk2,X1) ),
c_0_27 ).
cnf(c_0_37,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != sk1
| X1 != sk5(X1)
| ~ memberP(sk2,X1) ),
c_0_28 ).
cnf(c_0_38,negated_conjecture,
( sk6 = X1
| nil = sk3
| ~ ssItem(X1)
| ~ memberP(sk4,X1)
| ~ leq(sk6,X1) ),
c_0_29 ).
cnf(c_0_39,negated_conjecture,
( leq(X1,sk5(X1))
| cons(X1,nil) != sk3
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_18]),c_0_19]) ).
cnf(c_0_40,negated_conjecture,
cons(sk6,nil) = sk3,
inference(sr,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
memberP(sk4,sk6),
inference(sr,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( memberP(sk4,sk5(X1))
| cons(X1,nil) != sk3
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_19]),c_0_18]),c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( ssItem(sk5(X1))
| cons(X1,nil) != sk3
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_18]),c_0_19]) ).
cnf(c_0_45,negated_conjecture,
( cons(X1,nil) != sk3
| sk5(X1) != X1
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_18]),c_0_19]) ).
cnf(c_0_46,negated_conjecture,
( sk6 = X1
| ~ memberP(sk4,X1)
| ~ leq(sk6,X1)
| ~ ssItem(X1) ),
inference(sr,[status(thm)],[c_0_38,c_0_32]) ).
cnf(c_0_47,negated_conjecture,
leq(sk6,sk5(sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
memberP(sk4,sk5(sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_49,negated_conjecture,
ssItem(sk5(sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_50,negated_conjecture,
sk5(sk6) != sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_51,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_46,c_0_47]),c_0_48]),c_0_49])]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWC098-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:52:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.45 Running first-order theorem proving
% 0.20/0.45 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.20/0.47 # Version: 3.1.0
% 0.20/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47 # Starting sh5l with 300s (1) cores
% 0.20/0.47 # new_bool_3 with pid 21820 completed with status 0
% 0.20/0.47 # Result found by new_bool_3
% 0.20/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.47 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 21823 completed with status 0
% 0.20/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.47 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.47 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.47 # Preprocessing time : 0.001 s
% 0.20/0.47 # Presaturation interreduction done
% 0.20/0.47
% 0.20/0.47 # Proof found!
% 0.20/0.47 # SZS status Unsatisfiable
% 0.20/0.47 # SZS output start CNFRefutation
% See solution above
% 0.20/0.47 # Parsed axioms : 204
% 0.20/0.47 # Removed by relevancy pruning/SinE : 149
% 0.20/0.47 # Initial clauses : 55
% 0.20/0.47 # Removed in clause preprocessing : 0
% 0.20/0.47 # Initial clauses in saturation : 55
% 0.20/0.47 # Processed clauses : 106
% 0.20/0.47 # ...of these trivial : 2
% 0.20/0.47 # ...subsumed : 5
% 0.20/0.47 # ...remaining for further processing : 99
% 0.20/0.47 # Other redundant clauses eliminated : 5
% 0.20/0.47 # Clauses deleted for lack of memory : 0
% 0.20/0.47 # Backward-subsumed : 3
% 0.20/0.47 # Backward-rewritten : 0
% 0.20/0.47 # Generated clauses : 34
% 0.20/0.47 # ...of the previous two non-redundant : 24
% 0.20/0.47 # ...aggressively subsumed : 0
% 0.20/0.47 # Contextual simplify-reflections : 2
% 0.20/0.47 # Paramodulations : 28
% 0.20/0.47 # Factorizations : 0
% 0.20/0.47 # NegExts : 0
% 0.20/0.47 # Equation resolutions : 5
% 0.20/0.47 # Disequality decompositions : 0
% 0.20/0.47 # Total rewrite steps : 55
% 0.20/0.47 # ...of those cached : 45
% 0.20/0.47 # Propositional unsat checks : 0
% 0.20/0.47 # Propositional check models : 0
% 0.20/0.47 # Propositional check unsatisfiable : 0
% 0.20/0.47 # Propositional clauses : 0
% 0.20/0.47 # Propositional clauses after purity: 0
% 0.20/0.47 # Propositional unsat core size : 0
% 0.20/0.47 # Propositional preprocessing time : 0.000
% 0.20/0.47 # Propositional encoding time : 0.000
% 0.20/0.47 # Propositional solver time : 0.000
% 0.20/0.47 # Success case prop preproc time : 0.000
% 0.20/0.47 # Success case prop encoding time : 0.000
% 0.20/0.47 # Success case prop solver time : 0.000
% 0.20/0.47 # Current number of processed clauses : 39
% 0.20/0.47 # Positive orientable unit clauses : 13
% 0.20/0.47 # Positive unorientable unit clauses: 0
% 0.20/0.47 # Negative unit clauses : 2
% 0.20/0.47 # Non-unit-clauses : 24
% 0.20/0.47 # Current number of unprocessed clauses: 22
% 0.20/0.47 # ...number of literals in the above : 105
% 0.20/0.47 # Current number of archived formulas : 0
% 0.20/0.47 # Current number of archived clauses : 56
% 0.20/0.47 # Clause-clause subsumption calls (NU) : 334
% 0.20/0.47 # Rec. Clause-clause subsumption calls : 79
% 0.20/0.47 # Non-unit clause-clause subsumptions : 5
% 0.20/0.47 # Unit Clause-clause subsumption calls : 24
% 0.20/0.47 # Rewrite failures with RHS unbound : 0
% 0.20/0.47 # BW rewrite match attempts : 2
% 0.20/0.47 # BW rewrite match successes : 2
% 0.20/0.47 # Condensation attempts : 0
% 0.20/0.47 # Condensation successes : 0
% 0.20/0.47 # Termbank termtop insertions : 4424
% 0.20/0.47 # Search garbage collected termcells : 918
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.005 s
% 0.20/0.47 # System time : 0.001 s
% 0.20/0.47 # Total time : 0.006 s
% 0.20/0.47 # Maximum resident set size: 2072 pages
% 0.20/0.47
% 0.20/0.47 # -------------------------------------------------
% 0.20/0.47 # User time : 0.010 s
% 0.20/0.47 # System time : 0.002 s
% 0.20/0.47 # Total time : 0.012 s
% 0.20/0.47 # Maximum resident set size: 1880 pages
% 0.20/0.47 % E---3.1 exiting
% 0.20/0.47 % E exiting
%------------------------------------------------------------------------------