TSTP Solution File: SWC153-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC153-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:27:59 EDT 2024
% Result : Unsatisfiable 0.21s 0.47s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 49 ( 24 unt; 0 nHn; 49 RR)
% Number of literals : 154 ( 19 equ; 110 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause130,axiom,
( X2 = X1
| ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause130) ).
cnf(co1_7,negated_conjecture,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_15,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_6,negated_conjecture,
sk3 = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_16,negated_conjecture,
leq(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_12,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( leq(X6,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1)
| ~ ssItem(X6)
| ~ memberP(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_18,negated_conjecture,
( memberP(sk8,sk10)
| ~ leq(sk5,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ssItem(sk10)
| ~ leq(sk5,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_19,negated_conjecture,
( ~ leq(sk10,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk5,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_8,negated_conjecture,
( leq(X1,X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1)
| ~ ssItem(X6)
| ~ memberP(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_0_15,plain,
( X2 = X1
| ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause130]) ).
cnf(c_0_16,negated_conjecture,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_15 ).
cnf(c_0_18,negated_conjecture,
sk3 = sk1,
co1_6 ).
cnf(c_0_19,plain,
( X2 = X1
| ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
leq(sk6,sk5),
co1_16 ).
cnf(c_0_21,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_22,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_23,negated_conjecture,
( leq(X1,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1) ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_26,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_27,negated_conjecture,
ssList(sk7),
co1_12 ).
cnf(c_0_28,negated_conjecture,
( leq(X6,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1)
| ~ ssItem(X6)
| ~ memberP(X4,X6) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_29,negated_conjecture,
( sk6 = sk5
| ~ leq(sk5,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
leq(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_20]),c_0_21]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,negated_conjecture,
( memberP(sk8,sk10)
| ~ leq(sk5,sk6) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_32,negated_conjecture,
( ssItem(sk10)
| ~ leq(sk5,sk6) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_33,negated_conjecture,
( ~ leq(sk10,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk5,sk6) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_34,negated_conjecture,
( leq(X6,X2)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1)
| ~ ssItem(X6)
| ~ memberP(X4,X6) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_36,negated_conjecture,
( memberP(sk8,sk10)
| ~ leq(sk5,sk6) ),
c_0_31 ).
cnf(c_0_37,negated_conjecture,
( ssItem(sk10)
| ~ leq(sk5,sk6) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( leq(X1,X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1)
| ~ ssItem(X6)
| ~ memberP(X4,X6) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_39,negated_conjecture,
( ~ leq(sk10,sk6)
| ~ leq(sk5,sk10)
| ~ leq(sk5,sk6) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
( leq(X1,sk5)
| ~ memberP(sk8,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_24]),c_0_20]),c_0_21]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
memberP(sk8,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_30])]) ).
cnf(c_0_42,negated_conjecture,
ssItem(sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_30])]) ).
cnf(c_0_43,negated_conjecture,
( leq(X1,X6)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(app(app(app(X3,cons(X1,nil)),X4),cons(X2,nil)),X5) != sk3
| ~ leq(X2,X1)
| ~ ssItem(X6)
| ~ memberP(X4,X6) ),
c_0_38 ).
cnf(c_0_44,negated_conjecture,
( ~ leq(sk5,sk10)
| ~ leq(sk10,sk5) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_30])]),c_0_35]) ).
cnf(c_0_45,negated_conjecture,
leq(sk10,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_46,negated_conjecture,
( leq(sk5,X1)
| ~ memberP(sk8,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_24]),c_0_20]),c_0_21]),c_0_22]),c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_47,negated_conjecture,
~ leq(sk5,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_42])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC153-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n021.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 03:53:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.44 Running first-order model finding
% 0.21/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Version: 3.1.0
% 0.21/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.47 # Starting sh5l with 300s (1) cores
% 0.21/0.47 # new_bool_3 with pid 26423 completed with status 0
% 0.21/0.47 # Result found by new_bool_3
% 0.21/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.21/0.47 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.21/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26432 completed with status 0
% 0.21/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.21/0.47 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.21/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.47 # Preprocessing time : 0.001 s
% 0.21/0.47 # Presaturation interreduction done
% 0.21/0.47
% 0.21/0.47 # Proof found!
% 0.21/0.47 # SZS status Unsatisfiable
% 0.21/0.47 # SZS output start CNFRefutation
% See solution above
% 0.21/0.47 # Parsed axioms : 204
% 0.21/0.47 # Removed by relevancy pruning/SinE : 157
% 0.21/0.47 # Initial clauses : 47
% 0.21/0.47 # Removed in clause preprocessing : 0
% 0.21/0.47 # Initial clauses in saturation : 47
% 0.21/0.47 # Processed clauses : 130
% 0.21/0.47 # ...of these trivial : 4
% 0.21/0.47 # ...subsumed : 3
% 0.21/0.47 # ...remaining for further processing : 123
% 0.21/0.47 # Other redundant clauses eliminated : 8
% 0.21/0.47 # Clauses deleted for lack of memory : 0
% 0.21/0.47 # Backward-subsumed : 15
% 0.21/0.47 # Backward-rewritten : 8
% 0.21/0.47 # Generated clauses : 243
% 0.21/0.47 # ...of the previous two non-redundant : 212
% 0.21/0.47 # ...aggressively subsumed : 0
% 0.21/0.47 # Contextual simplify-reflections : 0
% 0.21/0.47 # Paramodulations : 232
% 0.21/0.47 # Factorizations : 0
% 0.21/0.47 # NegExts : 0
% 0.21/0.47 # Equation resolutions : 12
% 0.21/0.47 # Disequality decompositions : 0
% 0.21/0.47 # Total rewrite steps : 255
% 0.21/0.47 # ...of those cached : 238
% 0.21/0.47 # Propositional unsat checks : 0
% 0.21/0.47 # Propositional check models : 0
% 0.21/0.47 # Propositional check unsatisfiable : 0
% 0.21/0.47 # Propositional clauses : 0
% 0.21/0.47 # Propositional clauses after purity: 0
% 0.21/0.47 # Propositional unsat core size : 0
% 0.21/0.47 # Propositional preprocessing time : 0.000
% 0.21/0.47 # Propositional encoding time : 0.000
% 0.21/0.47 # Propositional solver time : 0.000
% 0.21/0.47 # Success case prop preproc time : 0.000
% 0.21/0.47 # Success case prop encoding time : 0.000
% 0.21/0.47 # Success case prop solver time : 0.000
% 0.21/0.47 # Current number of processed clauses : 52
% 0.21/0.47 # Positive orientable unit clauses : 16
% 0.21/0.47 # Positive unorientable unit clauses: 0
% 0.21/0.47 # Negative unit clauses : 2
% 0.21/0.47 # Non-unit-clauses : 34
% 0.21/0.47 # Current number of unprocessed clauses: 170
% 0.21/0.47 # ...number of literals in the above : 1016
% 0.21/0.47 # Current number of archived formulas : 0
% 0.21/0.47 # Current number of archived clauses : 68
% 0.21/0.47 # Clause-clause subsumption calls (NU) : 1061
% 0.21/0.47 # Rec. Clause-clause subsumption calls : 257
% 0.21/0.47 # Non-unit clause-clause subsumptions : 10
% 0.21/0.47 # Unit Clause-clause subsumption calls : 83
% 0.21/0.47 # Rewrite failures with RHS unbound : 0
% 0.21/0.47 # BW rewrite match attempts : 3
% 0.21/0.47 # BW rewrite match successes : 3
% 0.21/0.47 # Condensation attempts : 0
% 0.21/0.47 # Condensation successes : 0
% 0.21/0.47 # Termbank termtop insertions : 9062
% 0.21/0.47 # Search garbage collected termcells : 933
% 0.21/0.47
% 0.21/0.47 # -------------------------------------------------
% 0.21/0.47 # User time : 0.005 s
% 0.21/0.47 # System time : 0.006 s
% 0.21/0.47 # Total time : 0.011 s
% 0.21/0.47 # Maximum resident set size: 2088 pages
% 0.21/0.47
% 0.21/0.47 # -------------------------------------------------
% 0.21/0.47 # User time : 0.009 s
% 0.21/0.47 # System time : 0.006 s
% 0.21/0.47 # Total time : 0.015 s
% 0.21/0.47 # Maximum resident set size: 1884 pages
% 0.21/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------