TSTP Solution File: SWC175-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC175-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:05 EDT 2024
% Result : Unsatisfiable 0.70s 0.56s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 53 ( 28 unt; 3 nHn; 53 RR)
% Number of literals : 127 ( 23 equ; 77 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_16,negated_conjecture,
~ neq(sk6,sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_15,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_12,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(c_0_17,negated_conjecture,
~ neq(sk6,sk7),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_18,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_19,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk1,
co1_15 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_22,negated_conjecture,
~ neq(sk6,sk7),
c_0_17 ).
cnf(c_0_23,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_18 ).
cnf(c_0_24,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_25,negated_conjecture,
ssItem(sk7),
co1_12 ).
cnf(c_0_26,negated_conjecture,
app(app(app(sk8,cons(sk6,nil)),cons(sk7,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_21 ).
cnf(c_0_28,negated_conjecture,
sk7 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_30,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_31,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk8,cons(sk6,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_30 ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_35,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk8,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_36,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_34 ).
cnf(c_0_37,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_38,plain,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_39,negated_conjecture,
( app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_40,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_41,plain,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
app(app(sk8,cons(sk6,nil)),app(cons(sk6,nil),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_43,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_40 ).
cnf(c_0_44,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_45,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_46,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
app(app(sk8,cons(sk6,nil)),cons(sk6,sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24]),c_0_29])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_44,c_0_20]) ).
cnf(c_0_49,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_50,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
c_0_45 ).
cnf(c_0_51,negated_conjecture,
lt(sk6,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_46,c_0_47]),c_0_24]),c_0_48]),c_0_29]),c_0_33]),c_0_37]),c_0_49])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC175-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 03:29:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.70/0.56 # Version: 3.1.0
% 0.70/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.56 # Starting sh5l with 300s (1) cores
% 0.70/0.56 # sh5l with pid 7784 completed with status 0
% 0.70/0.56 # Result found by sh5l
% 0.70/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.56 # Starting sh5l with 300s (1) cores
% 0.70/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.70/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.70/0.56 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.70/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.70/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 7792 completed with status 0
% 0.70/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.70/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.56 # Starting sh5l with 300s (1) cores
% 0.70/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.70/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.70/0.56 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.70/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.70/0.56 # Preprocessing time : 0.003 s
% 0.70/0.56 # Presaturation interreduction done
% 0.70/0.56
% 0.70/0.56 # Proof found!
% 0.70/0.56 # SZS status Unsatisfiable
% 0.70/0.56 # SZS output start CNFRefutation
% See solution above
% 0.70/0.56 # Parsed axioms : 202
% 0.70/0.56 # Removed by relevancy pruning/SinE : 30
% 0.70/0.56 # Initial clauses : 172
% 0.70/0.56 # Removed in clause preprocessing : 0
% 0.70/0.56 # Initial clauses in saturation : 172
% 0.70/0.56 # Processed clauses : 590
% 0.70/0.56 # ...of these trivial : 6
% 0.70/0.56 # ...subsumed : 62
% 0.70/0.56 # ...remaining for further processing : 522
% 0.70/0.56 # Other redundant clauses eliminated : 32
% 0.70/0.56 # Clauses deleted for lack of memory : 0
% 0.70/0.56 # Backward-subsumed : 14
% 0.70/0.56 # Backward-rewritten : 32
% 0.70/0.56 # Generated clauses : 881
% 0.70/0.56 # ...of the previous two non-redundant : 763
% 0.70/0.56 # ...aggressively subsumed : 0
% 0.70/0.56 # Contextual simplify-reflections : 21
% 0.70/0.56 # Paramodulations : 845
% 0.70/0.56 # Factorizations : 0
% 0.70/0.56 # NegExts : 0
% 0.70/0.56 # Equation resolutions : 37
% 0.70/0.56 # Disequality decompositions : 0
% 0.70/0.56 # Total rewrite steps : 917
% 0.70/0.56 # ...of those cached : 868
% 0.70/0.56 # Propositional unsat checks : 0
% 0.70/0.56 # Propositional check models : 0
% 0.70/0.56 # Propositional check unsatisfiable : 0
% 0.70/0.56 # Propositional clauses : 0
% 0.70/0.56 # Propositional clauses after purity: 0
% 0.70/0.56 # Propositional unsat core size : 0
% 0.70/0.56 # Propositional preprocessing time : 0.000
% 0.70/0.56 # Propositional encoding time : 0.000
% 0.70/0.56 # Propositional solver time : 0.000
% 0.70/0.56 # Success case prop preproc time : 0.000
% 0.70/0.56 # Success case prop encoding time : 0.000
% 0.70/0.56 # Success case prop solver time : 0.000
% 0.70/0.56 # Current number of processed clauses : 292
% 0.70/0.56 # Positive orientable unit clauses : 82
% 0.70/0.56 # Positive unorientable unit clauses: 0
% 0.70/0.56 # Negative unit clauses : 1
% 0.70/0.56 # Non-unit-clauses : 209
% 0.70/0.56 # Current number of unprocessed clauses: 503
% 0.70/0.56 # ...number of literals in the above : 2329
% 0.70/0.56 # Current number of archived formulas : 0
% 0.70/0.56 # Current number of archived clauses : 210
% 0.70/0.56 # Clause-clause subsumption calls (NU) : 15150
% 0.70/0.56 # Rec. Clause-clause subsumption calls : 5162
% 0.70/0.56 # Non-unit clause-clause subsumptions : 97
% 0.70/0.56 # Unit Clause-clause subsumption calls : 450
% 0.70/0.56 # Rewrite failures with RHS unbound : 0
% 0.70/0.56 # BW rewrite match attempts : 21
% 0.70/0.56 # BW rewrite match successes : 18
% 0.70/0.56 # Condensation attempts : 0
% 0.70/0.56 # Condensation successes : 0
% 0.70/0.56 # Termbank termtop insertions : 24567
% 0.70/0.56 # Search garbage collected termcells : 619
% 0.70/0.56
% 0.70/0.56 # -------------------------------------------------
% 0.70/0.56 # User time : 0.053 s
% 0.70/0.56 # System time : 0.006 s
% 0.70/0.56 # Total time : 0.059 s
% 0.70/0.56 # Maximum resident set size: 2236 pages
% 0.70/0.56
% 0.70/0.56 # -------------------------------------------------
% 0.70/0.56 # User time : 0.058 s
% 0.70/0.56 # System time : 0.007 s
% 0.70/0.56 # Total time : 0.065 s
% 0.70/0.56 # Maximum resident set size: 1876 pages
% 0.70/0.56 % E---3.1 exiting
% 0.70/0.56 % E exiting
%------------------------------------------------------------------------------