TSTP Solution File: SWC190-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC190-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:15 EDT 2024
% Result : Unsatisfiable 0.50s 0.56s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 55 ( 22 unt; 0 nHn; 55 RR)
% Number of literals : 140 ( 28 equ; 91 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 1 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 : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).
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_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_14,negated_conjecture,
( sk9 = X1
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_15,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_16,plain,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause175]) ).
cnf(c_0_17,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_18,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_20,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_21,plain,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk6,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_25,negated_conjecture,
( sk9 = X1
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_26,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),cons(sk6,sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
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_19])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_30,negated_conjecture,
( sk9 = X1
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,negated_conjecture,
( memberP(sk1,sk6)
| ~ ssList(app(sk7,cons(sk5,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_24]),c_0_28]),c_0_19])]) ).
cnf(c_0_33,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_35,negated_conjecture,
( sk9 = X1
| ~ memberP(sk1,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( memberP(sk1,sk6)
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_37,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_38,negated_conjecture,
( sk9 = sk6
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24])]) ).
cnf(c_0_39,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_37 ).
cnf(c_0_40,axiom,
ssList(nil),
clause8 ).
cnf(c_0_41,negated_conjecture,
( app(sk7,app(cons(sk5,nil),cons(sk6,sk8))) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,sk8))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_34])]) ).
cnf(c_0_42,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_43,negated_conjecture,
( sk9 = sk6
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]),c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
( app(sk7,cons(sk5,cons(sk6,sk8))) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,sk8))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
sk9 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_42]),c_0_40])]) ).
cnf(c_0_46,negated_conjecture,
( memberP(sk1,sk5)
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,sk8))
| ~ ssList(cons(sk5,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_44]),c_0_42]),c_0_28]),c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
sk5 != sk6,
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_48,negated_conjecture,
( sk6 = X1
| ~ memberP(sk1,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_35,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( memberP(sk1,sk5)
| ~ ssList(cons(sk6,sk8))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_34])]) ).
cnf(c_0_50,negated_conjecture,
sk5 != sk6,
c_0_47 ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(cons(sk6,sk8))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_42])]),c_0_50]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_24]),c_0_19])]) ).
cnf(c_0_53,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_39]),c_0_24]),c_0_40])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_39]),c_0_42]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC190-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n009.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:28:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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.50/0.56 # Version: 3.1.0
% 0.50/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.56 # Starting sh5l with 300s (1) cores
% 0.50/0.56 # new_bool_1 with pid 5166 completed with status 0
% 0.50/0.56 # Result found by new_bool_1
% 0.50/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.56 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.50/0.56 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.50/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.50/0.56 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5169 completed with status 0
% 0.50/0.56 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.50/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.56 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.50/0.56 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.50/0.56 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.50/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.50/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.50/0.56 # Preprocessing time : 0.002 s
% 0.50/0.56 # Presaturation interreduction done
% 0.50/0.56
% 0.50/0.56 # Proof found!
% 0.50/0.56 # SZS status Unsatisfiable
% 0.50/0.56 # SZS output start CNFRefutation
% See solution above
% 0.50/0.56 # Parsed axioms : 199
% 0.50/0.56 # Removed by relevancy pruning/SinE : 160
% 0.50/0.56 # Initial clauses : 39
% 0.50/0.56 # Removed in clause preprocessing : 0
% 0.50/0.56 # Initial clauses in saturation : 39
% 0.50/0.56 # Processed clauses : 323
% 0.50/0.56 # ...of these trivial : 6
% 0.50/0.56 # ...subsumed : 106
% 0.50/0.56 # ...remaining for further processing : 211
% 0.50/0.56 # Other redundant clauses eliminated : 8
% 0.50/0.56 # Clauses deleted for lack of memory : 0
% 0.50/0.56 # Backward-subsumed : 68
% 0.50/0.56 # Backward-rewritten : 6
% 0.50/0.56 # Generated clauses : 760
% 0.50/0.56 # ...of the previous two non-redundant : 638
% 0.50/0.56 # ...aggressively subsumed : 0
% 0.50/0.56 # Contextual simplify-reflections : 9
% 0.50/0.56 # Paramodulations : 747
% 0.50/0.56 # Factorizations : 0
% 0.50/0.56 # NegExts : 0
% 0.50/0.56 # Equation resolutions : 14
% 0.50/0.56 # Disequality decompositions : 0
% 0.50/0.56 # Total rewrite steps : 690
% 0.50/0.56 # ...of those cached : 678
% 0.50/0.56 # Propositional unsat checks : 0
% 0.50/0.56 # Propositional check models : 0
% 0.50/0.56 # Propositional check unsatisfiable : 0
% 0.50/0.56 # Propositional clauses : 0
% 0.50/0.56 # Propositional clauses after purity: 0
% 0.50/0.56 # Propositional unsat core size : 0
% 0.50/0.56 # Propositional preprocessing time : 0.000
% 0.50/0.56 # Propositional encoding time : 0.000
% 0.50/0.56 # Propositional solver time : 0.000
% 0.50/0.56 # Success case prop preproc time : 0.000
% 0.50/0.56 # Success case prop encoding time : 0.000
% 0.50/0.56 # Success case prop solver time : 0.000
% 0.50/0.56 # Current number of processed clauses : 97
% 0.50/0.56 # Positive orientable unit clauses : 13
% 0.50/0.56 # Positive unorientable unit clauses: 0
% 0.50/0.56 # Negative unit clauses : 6
% 0.50/0.56 # Non-unit-clauses : 78
% 0.50/0.56 # Current number of unprocessed clauses: 301
% 0.50/0.56 # ...number of literals in the above : 1794
% 0.50/0.56 # Current number of archived formulas : 0
% 0.50/0.56 # Current number of archived clauses : 111
% 0.50/0.56 # Clause-clause subsumption calls (NU) : 4933
% 0.50/0.56 # Rec. Clause-clause subsumption calls : 1120
% 0.50/0.56 # Non-unit clause-clause subsumptions : 153
% 0.50/0.56 # Unit Clause-clause subsumption calls : 162
% 0.50/0.56 # Rewrite failures with RHS unbound : 0
% 0.50/0.56 # BW rewrite match attempts : 2
% 0.50/0.56 # BW rewrite match successes : 2
% 0.50/0.56 # Condensation attempts : 0
% 0.50/0.56 # Condensation successes : 0
% 0.50/0.56 # Termbank termtop insertions : 17296
% 0.50/0.56 # Search garbage collected termcells : 906
% 0.50/0.56
% 0.50/0.56 # -------------------------------------------------
% 0.50/0.56 # User time : 0.032 s
% 0.50/0.56 # System time : 0.003 s
% 0.50/0.56 # Total time : 0.036 s
% 0.50/0.56 # Maximum resident set size: 2076 pages
% 0.50/0.56
% 0.50/0.56 # -------------------------------------------------
% 0.50/0.56 # User time : 0.035 s
% 0.50/0.56 # System time : 0.007 s
% 0.50/0.56 # Total time : 0.042 s
% 0.50/0.56 # Maximum resident set size: 1876 pages
% 0.50/0.56 % E---3.1 exiting
% 0.50/0.56 % E exiting
%------------------------------------------------------------------------------