TSTP Solution File: SWC220-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC220-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:32 EDT 2024
% Result : Unsatisfiable 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 15 unt; 11 nHn; 44 RR)
% Number of literals : 134 ( 34 equ; 85 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_17,negated_conjecture,
( nil = sk3
| leq(X1,sk6)
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_11,negated_conjecture,
( leq(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(sk5(X3,X2,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_12,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_13,negated_conjecture,
( nil = sk3
| leq(X1,sk6)
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_14,negated_conjecture,
( leq(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_15,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
co1_16 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
nil != sk1,
c_0_12 ).
cnf(c_0_18,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_13 ).
cnf(c_0_19,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
co1_15 ).
cnf(c_0_20,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_14 ).
cnf(c_0_21,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_22,negated_conjecture,
( nil = sk3
| leq(X1,sk6)
| ~ ssItem(X1)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1) ),
c_0_13 ).
cnf(c_0_23,negated_conjecture,
( leq(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_14 ).
cnf(c_0_24,negated_conjecture,
app(app(sk7,cons(sk6,nil)),sk8) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_17]) ).
cnf(c_0_25,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
ssList(sk8),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_21 ).
cnf(c_0_29,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_30,negated_conjecture,
( leq(X1,sk6)
| ~ memberP(sk7,X1)
| ~ memberP(sk8,X1)
| ~ leq(sk6,X1)
| ~ ssItem(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
leq(sk6,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
ssItem(sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_35,negated_conjecture,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ memberP(sk7,sk5(sk8,sk7,sk6))
| ~ memberP(sk8,sk5(sk8,sk7,sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
memberP(sk8,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_34 ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(sk5(X3,X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_39,negated_conjecture,
( leq(sk5(sk8,sk7,sk6),sk6)
| ~ memberP(sk7,sk5(sk8,sk7,sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
memberP(sk7,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(sk5(X3,X2,X1),X1) ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
leq(sk5(sk8,sk7,sk6),sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_24]),c_0_25]),c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC220-1 : TPTP v8.2.0. Released v2.4.0.
% 0.15/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:45:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 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.23/0.55 # Version: 3.1.0
% 0.23/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting sh5l with 300s (1) cores
% 0.23/0.55 # new_bool_1 with pid 13776 completed with status 0
% 0.23/0.55 # Result found by new_bool_1
% 0.23/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.23/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.23/0.55 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 13779 completed with status 0
% 0.23/0.55 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.23/0.55 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.23/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.23/0.55 # Preprocessing time : 0.005 s
% 0.23/0.55 # Presaturation interreduction done
% 0.23/0.55
% 0.23/0.55 # Proof found!
% 0.23/0.55 # SZS status Unsatisfiable
% 0.23/0.55 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 202
% 0.23/0.55 # Removed by relevancy pruning/SinE : 149
% 0.23/0.55 # Initial clauses : 53
% 0.23/0.55 # Removed in clause preprocessing : 0
% 0.23/0.55 # Initial clauses in saturation : 53
% 0.23/0.55 # Processed clauses : 210
% 0.23/0.55 # ...of these trivial : 2
% 0.23/0.55 # ...subsumed : 45
% 0.23/0.55 # ...remaining for further processing : 163
% 0.23/0.55 # Other redundant clauses eliminated : 9
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 6
% 0.23/0.55 # Backward-rewritten : 4
% 0.23/0.55 # Generated clauses : 267
% 0.23/0.55 # ...of the previous two non-redundant : 237
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 4
% 0.23/0.55 # Paramodulations : 255
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 13
% 0.23/0.55 # Disequality decompositions : 0
% 0.23/0.55 # Total rewrite steps : 242
% 0.23/0.55 # ...of those cached : 226
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 100
% 0.23/0.55 # Positive orientable unit clauses : 16
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 1
% 0.23/0.55 # Non-unit-clauses : 83
% 0.23/0.55 # Current number of unprocessed clauses: 122
% 0.23/0.55 # ...number of literals in the above : 605
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 59
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 1544
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 384
% 0.23/0.55 # Non-unit clause-clause subsumptions : 51
% 0.23/0.55 # Unit Clause-clause subsumption calls : 12
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 4
% 0.23/0.55 # BW rewrite match successes : 4
% 0.23/0.55 # Condensation attempts : 0
% 0.23/0.55 # Condensation successes : 0
% 0.23/0.55 # Termbank termtop insertions : 9466
% 0.23/0.55 # Search garbage collected termcells : 921
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.016 s
% 0.23/0.55 # System time : 0.007 s
% 0.23/0.55 # Total time : 0.023 s
% 0.23/0.55 # Maximum resident set size: 2060 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.021 s
% 0.23/0.55 # System time : 0.009 s
% 0.23/0.55 # Total time : 0.030 s
% 0.23/0.55 # Maximum resident set size: 1880 pages
% 0.23/0.55 % E---3.1 exiting
% 0.60/0.55 % E exiting
%------------------------------------------------------------------------------