TSTP Solution File: SWC241-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC241-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:51 EDT 2024
% Result : Unsatisfiable 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 13 unt; 8 nHn; 33 RR)
% Number of literals : 86 ( 25 equ; 51 neg)
% Maximal clause size : 5 ( 2 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( lt(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_13,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause103,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(co1_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(X1,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_10,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_11,negated_conjecture,
( lt(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_12,negated_conjecture,
( nil = sk3
| app(app(sk7,cons(sk6,nil)),sk8) = sk3 ),
co1_16 ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_14,negated_conjecture,
nil != sk1,
c_0_10 ).
cnf(c_0_15,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_13 ).
cnf(c_0_16,negated_conjecture,
( nil = sk3
| ssList(sk8) ),
co1_15 ).
cnf(c_0_17,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
co1_14 ).
cnf(c_0_18,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_19,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_20,negated_conjecture,
( lt(X1,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_11 ).
cnf(c_0_21,negated_conjecture,
app(app(sk7,cons(sk6,nil)),sk8) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_14]) ).
cnf(c_0_22,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13]),c_0_14]) ).
cnf(c_0_23,negated_conjecture,
ssList(sk8),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(X1,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_27,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_19 ).
cnf(c_0_28,negated_conjecture,
lt(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_20,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_29,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_25,c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ leq(X1,sk5(X3,X2,X1)) ),
c_0_26 ).
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(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_22])]) ).
cnf(c_0_32,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_30,c_0_31]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC241-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.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:34:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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.52 # Version: 3.1.0
% 0.18/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.52 # Starting sh5l with 300s (1) cores
% 0.18/0.52 # new_bool_3 with pid 27435 completed with status 0
% 0.18/0.52 # Result found by new_bool_3
% 0.18/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.18/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.18/0.52 # G-E--_208_B07_F1_SE_CS_SP_PS_S4d with pid 27438 completed with status 0
% 0.18/0.52 # Result found by G-E--_208_B07_F1_SE_CS_SP_PS_S4d
% 0.18/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.52 # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.18/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.52 # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 181s (1) cores
% 0.18/0.52 # Preprocessing time : 0.005 s
% 0.18/0.52 # Presaturation interreduction done
% 0.18/0.52
% 0.18/0.52 # Proof found!
% 0.18/0.52 # SZS status Unsatisfiable
% 0.18/0.52 # SZS output start CNFRefutation
% See solution above
% 0.18/0.52 # Parsed axioms : 202
% 0.18/0.52 # Removed by relevancy pruning/SinE : 149
% 0.18/0.52 # Initial clauses : 53
% 0.18/0.52 # Removed in clause preprocessing : 0
% 0.18/0.52 # Initial clauses in saturation : 53
% 0.18/0.52 # Processed clauses : 188
% 0.18/0.52 # ...of these trivial : 2
% 0.18/0.52 # ...subsumed : 39
% 0.18/0.52 # ...remaining for further processing : 147
% 0.18/0.52 # Other redundant clauses eliminated : 9
% 0.18/0.52 # Clauses deleted for lack of memory : 0
% 0.18/0.52 # Backward-subsumed : 6
% 0.18/0.52 # Backward-rewritten : 1
% 0.18/0.52 # Generated clauses : 221
% 0.18/0.52 # ...of the previous two non-redundant : 191
% 0.18/0.52 # ...aggressively subsumed : 0
% 0.18/0.52 # Contextual simplify-reflections : 3
% 0.18/0.52 # Paramodulations : 209
% 0.18/0.52 # Factorizations : 0
% 0.18/0.52 # NegExts : 0
% 0.18/0.52 # Equation resolutions : 13
% 0.18/0.52 # Disequality decompositions : 0
% 0.18/0.52 # Total rewrite steps : 175
% 0.18/0.52 # ...of those cached : 162
% 0.18/0.52 # Propositional unsat checks : 0
% 0.18/0.52 # Propositional check models : 0
% 0.18/0.52 # Propositional check unsatisfiable : 0
% 0.18/0.52 # Propositional clauses : 0
% 0.18/0.52 # Propositional clauses after purity: 0
% 0.18/0.52 # Propositional unsat core size : 0
% 0.18/0.52 # Propositional preprocessing time : 0.000
% 0.18/0.52 # Propositional encoding time : 0.000
% 0.18/0.52 # Propositional solver time : 0.000
% 0.18/0.52 # Success case prop preproc time : 0.000
% 0.18/0.52 # Success case prop encoding time : 0.000
% 0.18/0.52 # Success case prop solver time : 0.000
% 0.18/0.52 # Current number of processed clauses : 87
% 0.18/0.52 # Positive orientable unit clauses : 14
% 0.18/0.52 # Positive unorientable unit clauses: 0
% 0.18/0.52 # Negative unit clauses : 2
% 0.18/0.52 # Non-unit-clauses : 71
% 0.18/0.52 # Current number of unprocessed clauses: 101
% 0.18/0.52 # ...number of literals in the above : 516
% 0.18/0.52 # Current number of archived formulas : 0
% 0.18/0.52 # Current number of archived clauses : 56
% 0.18/0.52 # Clause-clause subsumption calls (NU) : 1208
% 0.18/0.52 # Rec. Clause-clause subsumption calls : 345
% 0.18/0.52 # Non-unit clause-clause subsumptions : 44
% 0.18/0.52 # Unit Clause-clause subsumption calls : 25
% 0.18/0.52 # Rewrite failures with RHS unbound : 0
% 0.18/0.52 # BW rewrite match attempts : 1
% 0.18/0.52 # BW rewrite match successes : 1
% 0.18/0.52 # Condensation attempts : 0
% 0.18/0.52 # Condensation successes : 0
% 0.18/0.52 # Termbank termtop insertions : 8431
% 0.18/0.52 # Search garbage collected termcells : 921
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.026 s
% 0.18/0.52 # System time : 0.005 s
% 0.18/0.52 # Total time : 0.031 s
% 0.18/0.52 # Maximum resident set size: 2060 pages
% 0.18/0.52
% 0.18/0.52 # -------------------------------------------------
% 0.18/0.52 # User time : 0.034 s
% 0.18/0.52 # System time : 0.009 s
% 0.18/0.52 # Total time : 0.042 s
% 0.18/0.52 # Maximum resident set size: 1880 pages
% 0.18/0.52 % E---3.1 exiting
% 0.18/0.53 % E exiting
%------------------------------------------------------------------------------