TSTP Solution File: SWC192-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC192-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:16 EDT 2024
% Result : Unsatisfiable 0.59s 0.56s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of clauses : 61 ( 31 unt; 5 nHn; 61 RR)
% Number of literals : 133 ( 43 equ; 71 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause180,axiom,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause180) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_12,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_17,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause1) ).
cnf(c_0_18,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,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_21,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_24,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_25,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_28,axiom,
ssList(nil),
clause8 ).
cnf(c_0_29,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_31,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_32,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_30]),c_0_28])]) ).
cnf(c_0_33,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
( app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_30]),c_0_28])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_37,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk5,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_23]),c_0_36])]) ).
cnf(c_0_38,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_27])]) ).
cnf(c_0_39,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_40,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_26]),c_0_30]),c_0_28])]) ).
cnf(c_0_41,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_39 ).
cnf(c_0_42,plain,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause180]) ).
cnf(c_0_43,negated_conjecture,
( app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_27]),c_0_36])]) ).
cnf(c_0_44,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_45,plain,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_26]),c_0_30]),c_0_28])]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_48,negated_conjecture,
sk5 != sk6,
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_49,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_44 ).
cnf(c_0_50,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_51,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
co1_14 ).
cnf(c_0_52,plain,
( X1 = X2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4)))) ),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
app(sk7,cons(sk5,cons(sk6,sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_30]),c_0_36])]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_47,c_0_19]) ).
cnf(c_0_55,negated_conjecture,
sk5 != sk6,
c_0_48 ).
cnf(c_0_56,negated_conjecture,
( sk3 = nil
| equalelemsP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_57,negated_conjecture,
~ equalelemsP(sk3),
inference(sr,[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(spm,[status(thm)],[c_0_52,c_0_53]),c_0_30]),c_0_27]),c_0_54]),c_0_36]),c_0_23])]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,axiom,
equalelemsP(nil),
clause1 ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC192-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % 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 02:34:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.59/0.56 # Version: 3.1.0
% 0.59/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.59/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.59/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.59/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.59/0.56 # Starting sh5l with 300s (1) cores
% 0.59/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 23858 completed with status 0
% 0.59/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.59/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.59/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.59/0.56 # No SInE strategy applied
% 0.59/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.59/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.59/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.59/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.59/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.59/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.59/0.56 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 23865 completed with status 0
% 0.59/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.59/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.59/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.59/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.59/0.56 # No SInE strategy applied
% 0.59/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.59/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.59/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.59/0.56 # Preprocessing time : 0.003 s
% 0.59/0.56 # Presaturation interreduction done
% 0.59/0.56
% 0.59/0.56 # Proof found!
% 0.59/0.56 # SZS status Unsatisfiable
% 0.59/0.56 # SZS output start CNFRefutation
% See solution above
% 0.59/0.56 # Parsed axioms : 203
% 0.59/0.56 # Removed by relevancy pruning/SinE : 0
% 0.59/0.56 # Initial clauses : 203
% 0.59/0.56 # Removed in clause preprocessing : 0
% 0.59/0.56 # Initial clauses in saturation : 203
% 0.59/0.56 # Processed clauses : 548
% 0.59/0.56 # ...of these trivial : 3
% 0.59/0.56 # ...subsumed : 58
% 0.59/0.56 # ...remaining for further processing : 487
% 0.59/0.56 # Other redundant clauses eliminated : 48
% 0.59/0.56 # Clauses deleted for lack of memory : 0
% 0.59/0.56 # Backward-subsumed : 2
% 0.59/0.56 # Backward-rewritten : 75
% 0.59/0.56 # Generated clauses : 726
% 0.59/0.56 # ...of the previous two non-redundant : 623
% 0.59/0.56 # ...aggressively subsumed : 0
% 0.59/0.56 # Contextual simplify-reflections : 38
% 0.59/0.56 # Paramodulations : 672
% 0.59/0.56 # Factorizations : 0
% 0.59/0.56 # NegExts : 0
% 0.59/0.56 # Equation resolutions : 53
% 0.59/0.56 # Disequality decompositions : 0
% 0.59/0.57 # Total rewrite steps : 640
% 0.59/0.57 # ...of those cached : 599
% 0.59/0.57 # Propositional unsat checks : 0
% 0.59/0.57 # Propositional check models : 0
% 0.59/0.57 # Propositional check unsatisfiable : 0
% 0.59/0.57 # Propositional clauses : 0
% 0.59/0.57 # Propositional clauses after purity: 0
% 0.59/0.57 # Propositional unsat core size : 0
% 0.59/0.57 # Propositional preprocessing time : 0.000
% 0.59/0.57 # Propositional encoding time : 0.000
% 0.59/0.57 # Propositional solver time : 0.000
% 0.59/0.57 # Success case prop preproc time : 0.000
% 0.59/0.57 # Success case prop encoding time : 0.000
% 0.59/0.57 # Success case prop solver time : 0.000
% 0.59/0.57 # Current number of processed clauses : 190
% 0.59/0.57 # Positive orientable unit clauses : 65
% 0.59/0.57 # Positive unorientable unit clauses: 0
% 0.59/0.57 # Negative unit clauses : 3
% 0.59/0.57 # Non-unit-clauses : 122
% 0.59/0.57 # Current number of unprocessed clauses: 471
% 0.59/0.57 # ...number of literals in the above : 2263
% 0.59/0.57 # Current number of archived formulas : 0
% 0.59/0.57 # Current number of archived clauses : 274
% 0.59/0.57 # Clause-clause subsumption calls (NU) : 12601
% 0.59/0.57 # Rec. Clause-clause subsumption calls : 2050
% 0.59/0.57 # Non-unit clause-clause subsumptions : 92
% 0.59/0.57 # Unit Clause-clause subsumption calls : 343
% 0.59/0.57 # Rewrite failures with RHS unbound : 0
% 0.59/0.57 # BW rewrite match attempts : 14
% 0.59/0.57 # BW rewrite match successes : 9
% 0.59/0.57 # Condensation attempts : 0
% 0.59/0.57 # Condensation successes : 0
% 0.59/0.57 # Termbank termtop insertions : 21084
% 0.59/0.57 # Search garbage collected termcells : 529
% 0.59/0.57
% 0.59/0.57 # -------------------------------------------------
% 0.59/0.57 # User time : 0.046 s
% 0.59/0.57 # System time : 0.009 s
% 0.59/0.57 # Total time : 0.055 s
% 0.59/0.57 # Maximum resident set size: 2140 pages
% 0.59/0.57
% 0.59/0.57 # -------------------------------------------------
% 0.59/0.57 # User time : 0.204 s
% 0.59/0.57 # System time : 0.034 s
% 0.59/0.57 # Total time : 0.237 s
% 0.59/0.57 # Maximum resident set size: 1876 pages
% 0.59/0.57 % E---3.1 exiting
% 0.59/0.57 % E exiting
%------------------------------------------------------------------------------