TSTP Solution File: SWC304-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC304-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:29 EDT 2023
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of clauses : 52 ( 33 unt; 2 nHn; 52 RR)
% Number of literals : 112 ( 22 equ; 62 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_18,negated_conjecture,
app(app(app(app(sk9,cons(sk7,nil)),sk10),cons(sk8,nil)),sk11) = sk1,
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.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/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause149) ).
cnf(co1_15,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_15) ).
cnf(co1_16,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_16) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause86) ).
cnf(co1_13,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_13) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause120) ).
cnf(co1_17,negated_conjecture,
ssList(sk11),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_17) ).
cnf(co1_14,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_14) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause85) ).
cnf(clause182,axiom,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause182) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_1) ).
cnf(co1_10,negated_conjecture,
totalorderedP(sk3),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_10) ).
cnf(clause114,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause114) ).
cnf(co1_19,negated_conjecture,
lt(sk8,sk7),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',co1_19) ).
cnf(clause121,axiom,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p',clause121) ).
cnf(c_0_18,negated_conjecture,
app(app(app(app(sk9,cons(sk7,nil)),sk10),cons(sk8,nil)),sk11) = sk1,
co1_18 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
app(app(app(app(sk9,cons(sk7,nil)),sk10),cons(sk8,nil)),sk11) = sk3,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_22,negated_conjecture,
ssList(sk9),
co1_15 ).
cnf(c_0_23,negated_conjecture,
ssList(sk10),
co1_16 ).
cnf(c_0_24,negated_conjecture,
( app(app(app(sk9,app(cons(sk7,nil),sk10)),cons(sk8,nil)),sk11) = sk3
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[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])]) ).
cnf(c_0_25,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_26,negated_conjecture,
ssItem(sk7),
co1_13 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,negated_conjecture,
app(app(app(sk9,app(cons(sk7,nil),sk10)),cons(sk8,nil)),sk11) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_29,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_30,negated_conjecture,
app(app(app(sk9,cons(sk7,sk10)),cons(sk8,nil)),sk11) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk11),
co1_17 ).
cnf(c_0_32,negated_conjecture,
( app(app(sk9,cons(sk7,sk10)),app(cons(sk8,nil),sk11)) = sk3
| ~ ssList(app(sk9,cons(sk7,sk10)))
| ~ ssList(cons(sk8,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(sk8),
co1_14 ).
cnf(c_0_34,negated_conjecture,
( app(app(sk9,cons(sk7,sk10)),app(cons(sk8,nil),sk11)) = sk3
| ~ ssList(app(sk9,cons(sk7,sk10))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_33]),c_0_27])]) ).
cnf(c_0_35,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_36,negated_conjecture,
( app(app(sk9,cons(sk7,sk10)),app(cons(sk8,nil),sk11)) = sk3
| ~ ssList(cons(sk7,sk10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22])]) ).
cnf(c_0_37,axiom,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
clause182 ).
cnf(c_0_38,negated_conjecture,
app(app(sk9,cons(sk7,sk10)),app(cons(sk8,nil),sk11)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_25]),c_0_26]),c_0_23])]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_40,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
app(app(sk9,cons(sk7,sk10)),cons(sk8,sk11)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_33]),c_0_31])]) ).
cnf(c_0_42,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_39,c_0_19]) ).
cnf(c_0_43,negated_conjecture,
totalorderedP(sk3),
co1_10 ).
cnf(c_0_44,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause114 ).
cnf(c_0_45,negated_conjecture,
lt(sk8,sk7),
co1_19 ).
cnf(c_0_46,axiom,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause121 ).
cnf(c_0_47,negated_conjecture,
leq(sk7,sk8),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]),c_0_26]),c_0_42]),c_0_31]),c_0_23]),c_0_22]),c_0_43])]) ).
cnf(c_0_48,negated_conjecture,
~ lt(sk7,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]),c_0_26])]) ).
cnf(c_0_49,negated_conjecture,
sk8 = sk7,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33]),c_0_26])]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
~ lt(sk7,sk7),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC304-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 2400
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue Oct 3 01:57:35 EDT 2023
% 0.08/0.29 % CPUTime :
% 0.12/0.38 Running first-order model finding
% 0.12/0.38 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/tmp/tmp.xDNhEpEhbA/E---3.1_21439.p
% 0.12/0.42 # Version: 3.1pre001
% 0.12/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 # Starting sh5l with 300s (1) cores
% 0.12/0.42 # sh5l with pid 21580 completed with status 0
% 0.12/0.42 # Result found by sh5l
% 0.12/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 # Starting sh5l with 300s (1) cores
% 0.12/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.42 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.12/0.42 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.12/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 21588 completed with status 0
% 0.12/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.12/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 # Starting sh5l with 300s (1) cores
% 0.12/0.42 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.42 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.12/0.42 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.12/0.42 # Preprocessing time : 0.002 s
% 0.12/0.42 # Presaturation interreduction done
% 0.12/0.42
% 0.12/0.42 # Proof found!
% 0.12/0.42 # SZS status Unsatisfiable
% 0.12/0.42 # SZS output start CNFRefutation
% See solution above
% 0.12/0.42 # Parsed axioms : 205
% 0.12/0.42 # Removed by relevancy pruning/SinE : 34
% 0.12/0.42 # Initial clauses : 171
% 0.12/0.42 # Removed in clause preprocessing : 0
% 0.12/0.42 # Initial clauses in saturation : 171
% 0.12/0.42 # Processed clauses : 553
% 0.12/0.42 # ...of these trivial : 4
% 0.12/0.42 # ...subsumed : 71
% 0.12/0.42 # ...remaining for further processing : 477
% 0.12/0.42 # Other redundant clauses eliminated : 29
% 0.12/0.42 # Clauses deleted for lack of memory : 0
% 0.12/0.42 # Backward-subsumed : 12
% 0.12/0.42 # Backward-rewritten : 35
% 0.12/0.42 # Generated clauses : 772
% 0.12/0.42 # ...of the previous two non-redundant : 707
% 0.12/0.42 # ...aggressively subsumed : 0
% 0.12/0.42 # Contextual simplify-reflections : 33
% 0.12/0.42 # Paramodulations : 739
% 0.12/0.42 # Factorizations : 0
% 0.12/0.42 # NegExts : 0
% 0.12/0.42 # Equation resolutions : 34
% 0.12/0.42 # Total rewrite steps : 710
% 0.12/0.42 # Propositional unsat checks : 0
% 0.12/0.42 # Propositional check models : 0
% 0.12/0.42 # Propositional check unsatisfiable : 0
% 0.12/0.42 # Propositional clauses : 0
% 0.12/0.42 # Propositional clauses after purity: 0
% 0.12/0.42 # Propositional unsat core size : 0
% 0.12/0.42 # Propositional preprocessing time : 0.000
% 0.12/0.42 # Propositional encoding time : 0.000
% 0.12/0.42 # Propositional solver time : 0.000
% 0.12/0.42 # Success case prop preproc time : 0.000
% 0.12/0.42 # Success case prop encoding time : 0.000
% 0.12/0.42 # Success case prop solver time : 0.000
% 0.12/0.42 # Current number of processed clauses : 249
% 0.12/0.42 # Positive orientable unit clauses : 78
% 0.12/0.42 # Positive unorientable unit clauses: 0
% 0.12/0.42 # Negative unit clauses : 2
% 0.12/0.42 # Non-unit-clauses : 169
% 0.12/0.42 # Current number of unprocessed clauses: 485
% 0.12/0.42 # ...number of literals in the above : 2169
% 0.12/0.42 # Current number of archived formulas : 0
% 0.12/0.42 # Current number of archived clauses : 210
% 0.12/0.42 # Clause-clause subsumption calls (NU) : 11827
% 0.12/0.42 # Rec. Clause-clause subsumption calls : 3186
% 0.12/0.42 # Non-unit clause-clause subsumptions : 116
% 0.12/0.42 # Unit Clause-clause subsumption calls : 435
% 0.12/0.42 # Rewrite failures with RHS unbound : 0
% 0.12/0.42 # BW rewrite match attempts : 21
% 0.12/0.42 # BW rewrite match successes : 17
% 0.12/0.42 # Condensation attempts : 0
% 0.12/0.42 # Condensation successes : 0
% 0.12/0.42 # Termbank termtop insertions : 20962
% 0.12/0.42
% 0.12/0.42 # -------------------------------------------------
% 0.12/0.42 # User time : 0.025 s
% 0.12/0.42 # System time : 0.006 s
% 0.12/0.42 # Total time : 0.031 s
% 0.12/0.42 # Maximum resident set size: 2208 pages
% 0.12/0.42
% 0.12/0.42 # -------------------------------------------------
% 0.12/0.42 # User time : 0.027 s
% 0.12/0.42 # System time : 0.008 s
% 0.12/0.42 # Total time : 0.035 s
% 0.12/0.42 # Maximum resident set size: 1860 pages
% 0.12/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------