TSTP Solution File: SWC300-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC300-1 : TPTP v8.1.2. 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 : Sat May 4 09:41:53 EDT 2024
% Result : Unsatisfiable 0.73s 0.58s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of clauses : 58 ( 32 unt; 3 nHn; 58 RR)
% Number of literals : 142 ( 25 equ; 86 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 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 : 62 ( 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/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',clause149) ).
cnf(co1_13,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_13) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_10) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_11) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',clause120) ).
cnf(co1_12,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_12) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_9) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.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.eVgWpbhh2c/E---3.1_26206.p',clause182) ).
cnf(co1_7,negated_conjecture,
totalorderedP(sk3),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_6) ).
cnf(clause114,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',clause114) ).
cnf(clause121,axiom,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',clause121) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_1) ).
cnf(co1_14,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox2/tmp/tmp.eVgWpbhh2c/E---3.1_26206.p',co1_14) ).
cnf(c_0_18,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_19,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_13 ).
cnf(c_0_20,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_18 ).
cnf(c_0_21,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_22,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_23,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_24,negated_conjecture,
( app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_27,axiom,
ssList(nil),
clause8 ).
cnf(c_0_28,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_29,negated_conjecture,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1,
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_30,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_28 ).
cnf(c_0_31,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_22])]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk9),
co1_12 ).
cnf(c_0_33,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_31]),c_0_32])]) ).
cnf(c_0_34,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_35,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_36,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1
| ~ ssList(app(sk7,cons(sk5,sk8))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_34]),c_0_27])]) ).
cnf(c_0_37,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_35 ).
cnf(c_0_38,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[clause182]) ).
cnf(c_0_39,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1
| ~ ssList(cons(sk5,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_21])]) ).
cnf(c_0_40,plain,
( 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) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_25]),c_0_26]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
totalorderedP(sk3),
co1_7 ).
cnf(c_0_43,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_44,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_45,plain,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause121]) ).
cnf(c_0_46,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_40]) ).
cnf(c_0_47,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_34]),c_0_32])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,negated_conjecture,
totalorderedP(sk1),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_44 ).
cnf(c_0_51,negated_conjecture,
lt(sk6,sk5),
co1_14 ).
cnf(c_0_52,plain,
( lt(X1,X2)
| X1 = X2
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_45 ).
cnf(c_0_53,negated_conjecture,
leq(sk5,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34]),c_0_26]),c_0_48]),c_0_32]),c_0_22]),c_0_21]),c_0_49])]) ).
cnf(c_0_54,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_34]),c_0_26])]) ).
cnf(c_0_55,negated_conjecture,
sk6 = sk5,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_34]),c_0_26])]),c_0_54]) ).
cnf(c_0_56,negated_conjecture,
~ lt(sk5,sk5),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC300-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.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 : Fri May 3 15:32:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.eVgWpbhh2c/E---3.1_26206.p
% 0.73/0.58 # Version: 3.1.0
% 0.73/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.58 # Starting sh5l with 300s (1) cores
% 0.73/0.58 # sh5l with pid 26286 completed with status 0
% 0.73/0.58 # Result found by sh5l
% 0.73/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.58 # Starting sh5l with 300s (1) cores
% 0.73/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.73/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.73/0.58 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.73/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 26294 completed with status 0
% 0.73/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.73/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.73/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.73/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.73/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.73/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.73/0.58 # Starting sh5l with 300s (1) cores
% 0.73/0.58 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.73/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.73/0.58 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.73/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.73/0.58 # Preprocessing time : 0.003 s
% 0.73/0.58 # Presaturation interreduction done
% 0.73/0.58
% 0.73/0.58 # Proof found!
% 0.73/0.58 # SZS status Unsatisfiable
% 0.73/0.58 # SZS output start CNFRefutation
% See solution above
% 0.73/0.58 # Parsed axioms : 199
% 0.73/0.58 # Removed by relevancy pruning/SinE : 34
% 0.73/0.58 # Initial clauses : 165
% 0.73/0.58 # Removed in clause preprocessing : 0
% 0.73/0.58 # Initial clauses in saturation : 165
% 0.73/0.58 # Processed clauses : 529
% 0.73/0.58 # ...of these trivial : 3
% 0.73/0.58 # ...subsumed : 76
% 0.73/0.58 # ...remaining for further processing : 449
% 0.73/0.58 # Other redundant clauses eliminated : 37
% 0.73/0.58 # Clauses deleted for lack of memory : 0
% 0.73/0.58 # Backward-subsumed : 8
% 0.73/0.58 # Backward-rewritten : 32
% 0.73/0.58 # Generated clauses : 927
% 0.73/0.58 # ...of the previous two non-redundant : 819
% 0.73/0.58 # ...aggressively subsumed : 0
% 0.73/0.58 # Contextual simplify-reflections : 17
% 0.73/0.58 # Paramodulations : 886
% 0.73/0.58 # Factorizations : 0
% 0.73/0.58 # NegExts : 0
% 0.73/0.58 # Equation resolutions : 42
% 0.73/0.58 # Disequality decompositions : 0
% 0.73/0.58 # Total rewrite steps : 983
% 0.73/0.58 # ...of those cached : 918
% 0.73/0.58 # Propositional unsat checks : 0
% 0.73/0.58 # Propositional check models : 0
% 0.73/0.58 # Propositional check unsatisfiable : 0
% 0.73/0.58 # Propositional clauses : 0
% 0.73/0.58 # Propositional clauses after purity: 0
% 0.73/0.58 # Propositional unsat core size : 0
% 0.73/0.58 # Propositional preprocessing time : 0.000
% 0.73/0.58 # Propositional encoding time : 0.000
% 0.73/0.58 # Propositional solver time : 0.000
% 0.73/0.58 # Success case prop preproc time : 0.000
% 0.73/0.58 # Success case prop encoding time : 0.000
% 0.73/0.58 # Success case prop solver time : 0.000
% 0.73/0.58 # Current number of processed clauses : 234
% 0.73/0.58 # Positive orientable unit clauses : 73
% 0.73/0.58 # Positive unorientable unit clauses: 0
% 0.73/0.58 # Negative unit clauses : 3
% 0.73/0.58 # Non-unit-clauses : 158
% 0.73/0.58 # Current number of unprocessed clauses: 608
% 0.73/0.58 # ...number of literals in the above : 2921
% 0.73/0.58 # Current number of archived formulas : 0
% 0.73/0.58 # Current number of archived clauses : 197
% 0.73/0.58 # Clause-clause subsumption calls (NU) : 10815
% 0.73/0.58 # Rec. Clause-clause subsumption calls : 2494
% 0.73/0.58 # Non-unit clause-clause subsumptions : 101
% 0.73/0.58 # Unit Clause-clause subsumption calls : 520
% 0.73/0.58 # Rewrite failures with RHS unbound : 0
% 0.73/0.58 # BW rewrite match attempts : 33
% 0.73/0.58 # BW rewrite match successes : 14
% 0.73/0.58 # Condensation attempts : 0
% 0.73/0.58 # Condensation successes : 0
% 0.73/0.58 # Termbank termtop insertions : 27632
% 0.73/0.58 # Search garbage collected termcells : 605
% 0.73/0.58
% 0.73/0.58 # -------------------------------------------------
% 0.73/0.58 # User time : 0.050 s
% 0.73/0.58 # System time : 0.005 s
% 0.73/0.58 # Total time : 0.055 s
% 0.73/0.58 # Maximum resident set size: 2224 pages
% 0.73/0.58
% 0.73/0.58 # -------------------------------------------------
% 0.73/0.58 # User time : 0.053 s
% 0.73/0.58 # System time : 0.008 s
% 0.73/0.58 # Total time : 0.061 s
% 0.73/0.58 # Maximum resident set size: 1872 pages
% 0.73/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------