TSTP Solution File: SWC166-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC166-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:03 EDT 2024
% Result : Unsatisfiable 0.94s 0.59s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of clauses : 62 ( 30 unt; 3 nHn; 60 RR)
% Number of literals : 147 ( 25 equ; 88 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 68 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
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_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_12,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
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(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(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_7,negated_conjecture,
singletonP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(c_0_20,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_21,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
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,
~ neq(sk5,sk6),
c_0_20 ).
cnf(c_0_24,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_26,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_27,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_12 ).
cnf(c_0_28,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_22 ).
cnf(c_0_29,negated_conjecture,
sk6 = sk5,
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_30,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_31,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_32,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_34,axiom,
ssList(nil),
clause8 ).
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,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25]),c_0_34])]) ).
cnf(c_0_37,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_35 ).
cnf(c_0_38,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_39,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_40,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_41,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_42,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_43,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_44,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_39 ).
cnf(c_0_45,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_40 ).
cnf(c_0_46,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_47,negated_conjecture,
singletonP(sk3),
co1_7 ).
cnf(c_0_48,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_49,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_41 ).
cnf(c_0_50,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_33]),c_0_25]),c_0_34])]) ).
cnf(c_0_51,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_43 ).
cnf(c_0_52,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_53,negated_conjecture,
singletonP(sk1),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_55,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_56,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_49]) ).
cnf(c_0_57,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_25]),c_0_30])]) ).
cnf(c_0_58,negated_conjecture,
strictorderedP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_59,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
c_0_55 ).
cnf(c_0_60,negated_conjecture,
lt(sk5,sk5),
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_56,c_0_57]),c_0_25]),c_0_54]),c_0_30]),c_0_34]),c_0_38]),c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC166-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:36:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.94/0.59 # Version: 3.1.0
% 0.94/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.94/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.94/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.59 # Starting sh5l with 300s (1) cores
% 0.94/0.59 # sh5l with pid 6528 completed with status 0
% 0.94/0.59 # Result found by sh5l
% 0.94/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.94/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.94/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.59 # Starting sh5l with 300s (1) cores
% 0.94/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.94/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.94/0.59 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.94/0.59 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 6536 completed with status 0
% 0.94/0.59 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.94/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.94/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.94/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.59 # Starting sh5l with 300s (1) cores
% 0.94/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.94/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.94/0.59 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.94/0.59 # Preprocessing time : 0.005 s
% 0.94/0.59 # Presaturation interreduction done
% 0.94/0.59
% 0.94/0.59 # Proof found!
% 0.94/0.59 # SZS status Unsatisfiable
% 0.94/0.59 # SZS output start CNFRefutation
% See solution above
% 0.94/0.59 # Parsed axioms : 198
% 0.94/0.59 # Removed by relevancy pruning/SinE : 26
% 0.94/0.59 # Initial clauses : 172
% 0.94/0.59 # Removed in clause preprocessing : 0
% 0.94/0.59 # Initial clauses in saturation : 172
% 0.94/0.59 # Processed clauses : 590
% 0.94/0.59 # ...of these trivial : 11
% 0.94/0.59 # ...subsumed : 48
% 0.94/0.59 # ...remaining for further processing : 531
% 0.94/0.59 # Other redundant clauses eliminated : 39
% 0.94/0.59 # Clauses deleted for lack of memory : 0
% 0.94/0.59 # Backward-subsumed : 15
% 0.94/0.59 # Backward-rewritten : 32
% 0.94/0.59 # Generated clauses : 997
% 0.94/0.59 # ...of the previous two non-redundant : 836
% 0.94/0.59 # ...aggressively subsumed : 0
% 0.94/0.59 # Contextual simplify-reflections : 8
% 0.94/0.59 # Paramodulations : 954
% 0.94/0.59 # Factorizations : 0
% 0.94/0.59 # NegExts : 0
% 0.94/0.59 # Equation resolutions : 44
% 0.94/0.59 # Disequality decompositions : 0
% 0.94/0.59 # Total rewrite steps : 1139
% 0.94/0.59 # ...of those cached : 1080
% 0.94/0.59 # Propositional unsat checks : 0
% 0.94/0.59 # Propositional check models : 0
% 0.94/0.59 # Propositional check unsatisfiable : 0
% 0.94/0.59 # Propositional clauses : 0
% 0.94/0.59 # Propositional clauses after purity: 0
% 0.94/0.59 # Propositional unsat core size : 0
% 0.94/0.59 # Propositional preprocessing time : 0.000
% 0.94/0.59 # Propositional encoding time : 0.000
% 0.94/0.59 # Propositional solver time : 0.000
% 0.94/0.59 # Success case prop preproc time : 0.000
% 0.94/0.59 # Success case prop encoding time : 0.000
% 0.94/0.59 # Success case prop solver time : 0.000
% 0.94/0.59 # Current number of processed clauses : 299
% 0.94/0.59 # Positive orientable unit clauses : 91
% 0.94/0.59 # Positive unorientable unit clauses: 0
% 0.94/0.59 # Negative unit clauses : 2
% 0.94/0.59 # Non-unit-clauses : 206
% 0.94/0.59 # Current number of unprocessed clauses: 575
% 0.94/0.59 # ...number of literals in the above : 2653
% 0.94/0.59 # Current number of archived formulas : 0
% 0.94/0.59 # Current number of archived clauses : 211
% 0.94/0.59 # Clause-clause subsumption calls (NU) : 13827
% 0.94/0.59 # Rec. Clause-clause subsumption calls : 4462
% 0.94/0.59 # Non-unit clause-clause subsumptions : 69
% 0.94/0.59 # Unit Clause-clause subsumption calls : 405
% 0.94/0.59 # Rewrite failures with RHS unbound : 0
% 0.94/0.59 # BW rewrite match attempts : 44
% 0.94/0.59 # BW rewrite match successes : 20
% 0.94/0.59 # Condensation attempts : 0
% 0.94/0.59 # Condensation successes : 0
% 0.94/0.59 # Termbank termtop insertions : 28167
% 0.94/0.59 # Search garbage collected termcells : 598
% 0.94/0.59
% 0.94/0.59 # -------------------------------------------------
% 0.94/0.59 # User time : 0.090 s
% 0.94/0.59 # System time : 0.011 s
% 0.94/0.59 # Total time : 0.101 s
% 0.94/0.59 # Maximum resident set size: 2232 pages
% 0.94/0.59
% 0.94/0.59 # -------------------------------------------------
% 0.94/0.59 # User time : 0.096 s
% 0.94/0.59 # System time : 0.012 s
% 0.94/0.59 # Total time : 0.108 s
% 0.94/0.59 # Maximum resident set size: 1876 pages
% 0.94/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------