TSTP Solution File: SWC298-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC298-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:28:54 EDT 2024
% Result : Unsatisfiable 0.90s 0.60s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of clauses : 63 ( 32 unt; 5 nHn; 63 RR)
% Number of literals : 143 ( 30 equ; 80 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
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(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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(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_11,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(clause114,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_19,negated_conjecture,
( cons(sk10,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_15,negated_conjecture,
( ssItem(sk10)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause3) ).
cnf(c_0_20,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_12 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,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_23,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_22 ).
cnf(c_0_25,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_26,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_27,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_28,negated_conjecture,
( app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_27 ).
cnf(c_0_30,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_33,negated_conjecture,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = 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_30]),c_0_31])]) ).
cnf(c_0_34,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_32 ).
cnf(c_0_35,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk9),
co1_11 ).
cnf(c_0_37,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_35]),c_0_36])]) ).
cnf(c_0_38,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_39,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_40,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_38]),c_0_31])]) ).
cnf(c_0_41,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_42,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_43,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(cons(sk5,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25])]) ).
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,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_46,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_42 ).
cnf(c_0_47,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_29]),c_0_30]),c_0_26])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,plain,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_44 ).
cnf(c_0_50,negated_conjecture,
lt(sk6,sk5),
co1_13 ).
cnf(c_0_51,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_45 ).
cnf(c_0_52,negated_conjecture,
( cons(sk10,nil) = sk3
| nil = sk3 ),
co1_19 ).
cnf(c_0_53,negated_conjecture,
( ssItem(sk10)
| nil = sk3 ),
co1_15 ).
cnf(c_0_54,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_46]) ).
cnf(c_0_55,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_34]),c_0_38]),c_0_36])]) ).
cnf(c_0_56,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_48,c_0_21]) ).
cnf(c_0_57,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_38]),c_0_30])]) ).
cnf(c_0_58,negated_conjecture,
( sk3 = nil
| strictorderedP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_59,negated_conjecture,
~ strictorderedP(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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_38]),c_0_30]),c_0_56]),c_0_36]),c_0_26]),c_0_25])]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC298-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n002.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:22:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order model finding
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.90/0.60 # Version: 3.1.0
% 0.90/0.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.90/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.90/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.90/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.90/0.60 # Starting sh5l with 300s (1) cores
% 0.90/0.60 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11833 completed with status 0
% 0.90/0.60 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.90/0.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.90/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.90/0.60 # No SInE strategy applied
% 0.90/0.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.90/0.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.90/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.90/0.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.90/0.60 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.90/0.60 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.90/0.60 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 11839 completed with status 0
% 0.90/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.90/0.60 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.90/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.60 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.90/0.60 # No SInE strategy applied
% 0.90/0.60 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.90/0.60 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.60 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.90/0.60 # Preprocessing time : 0.003 s
% 0.90/0.60 # Presaturation interreduction done
% 0.90/0.60
% 0.90/0.60 # Proof found!
% 0.90/0.60 # SZS status Unsatisfiable
% 0.90/0.60 # SZS output start CNFRefutation
% See solution above
% 0.90/0.60 # Parsed axioms : 206
% 0.90/0.60 # Removed by relevancy pruning/SinE : 0
% 0.90/0.60 # Initial clauses : 206
% 0.90/0.60 # Removed in clause preprocessing : 0
% 0.90/0.60 # Initial clauses in saturation : 206
% 0.90/0.60 # Processed clauses : 713
% 0.90/0.60 # ...of these trivial : 3
% 0.90/0.60 # ...subsumed : 141
% 0.90/0.60 # ...remaining for further processing : 569
% 0.90/0.60 # Other redundant clauses eliminated : 72
% 0.90/0.60 # Clauses deleted for lack of memory : 0
% 0.90/0.60 # Backward-subsumed : 8
% 0.90/0.60 # Backward-rewritten : 109
% 0.90/0.60 # Generated clauses : 1365
% 0.90/0.60 # ...of the previous two non-redundant : 1174
% 0.90/0.60 # ...aggressively subsumed : 0
% 0.90/0.60 # Contextual simplify-reflections : 40
% 0.90/0.60 # Paramodulations : 1287
% 0.90/0.60 # Factorizations : 0
% 0.90/0.60 # NegExts : 0
% 0.90/0.60 # Equation resolutions : 77
% 0.90/0.60 # Disequality decompositions : 0
% 0.90/0.60 # Total rewrite steps : 1441
% 0.90/0.60 # ...of those cached : 1354
% 0.90/0.60 # Propositional unsat checks : 0
% 0.90/0.60 # Propositional check models : 0
% 0.90/0.60 # Propositional check unsatisfiable : 0
% 0.90/0.60 # Propositional clauses : 0
% 0.90/0.60 # Propositional clauses after purity: 0
% 0.90/0.60 # Propositional unsat core size : 0
% 0.90/0.60 # Propositional preprocessing time : 0.000
% 0.90/0.60 # Propositional encoding time : 0.000
% 0.90/0.60 # Propositional solver time : 0.000
% 0.90/0.60 # Success case prop preproc time : 0.000
% 0.90/0.60 # Success case prop encoding time : 0.000
% 0.90/0.60 # Success case prop solver time : 0.000
% 0.90/0.60 # Current number of processed clauses : 229
% 0.90/0.60 # Positive orientable unit clauses : 70
% 0.90/0.60 # Positive unorientable unit clauses: 0
% 0.90/0.60 # Negative unit clauses : 4
% 0.90/0.60 # Non-unit-clauses : 155
% 0.90/0.60 # Current number of unprocessed clauses: 861
% 0.90/0.60 # ...number of literals in the above : 4589
% 0.90/0.60 # Current number of archived formulas : 0
% 0.90/0.60 # Current number of archived clauses : 317
% 0.90/0.60 # Clause-clause subsumption calls (NU) : 16322
% 0.90/0.60 # Rec. Clause-clause subsumption calls : 2996
% 0.90/0.60 # Non-unit clause-clause subsumptions : 173
% 0.90/0.60 # Unit Clause-clause subsumption calls : 350
% 0.90/0.60 # Rewrite failures with RHS unbound : 0
% 0.90/0.60 # BW rewrite match attempts : 34
% 0.90/0.60 # BW rewrite match successes : 15
% 0.90/0.60 # Condensation attempts : 0
% 0.90/0.60 # Condensation successes : 0
% 0.90/0.60 # Termbank termtop insertions : 36404
% 0.90/0.60 # Search garbage collected termcells : 537
% 0.90/0.60
% 0.90/0.60 # -------------------------------------------------
% 0.90/0.60 # User time : 0.068 s
% 0.90/0.60 # System time : 0.008 s
% 0.90/0.60 # Total time : 0.076 s
% 0.90/0.60 # Maximum resident set size: 2152 pages
% 0.90/0.60
% 0.90/0.60 # -------------------------------------------------
% 0.90/0.60 # User time : 0.321 s
% 0.90/0.60 # System time : 0.033 s
% 0.90/0.60 # Total time : 0.354 s
% 0.90/0.60 # Maximum resident set size: 1880 pages
% 0.90/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------