TSTP Solution File: SWC181-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC181-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:08 EDT 2024
% Result : Unsatisfiable 0.23s 0.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 20 unt; 6 nHn; 25 RR)
% Number of literals : 88 ( 8 equ; 55 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
~ duplicatefreeP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
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(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
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(clause162,axiom,
( duplicatefreeP(X1)
| app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause162) ).
cnf(clause18,axiom,
ssList(skaf77(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause18) ).
cnf(clause19,axiom,
ssList(skaf76(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause19) ).
cnf(clause20,axiom,
ssList(skaf75(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause20) ).
cnf(co1_10,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_11,negated_conjecture,
~ duplicatefreeP(sk1),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_12,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_13,negated_conjecture,
~ duplicatefreeP(sk1),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_16,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_17,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_12 ).
cnf(c_0_18,negated_conjecture,
~ duplicatefreeP(sk3),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_22,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_17]) ).
cnf(c_0_23,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,plain,
( duplicatefreeP(X1)
| app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause162]) ).
cnf(c_0_25,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
c_0_21 ).
cnf(c_0_26,plain,
( lt(X1,X2)
| ~ 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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23])]) ).
cnf(c_0_27,plain,
( duplicatefreeP(X1)
| app(app(skaf75(X1),cons(skaf74(X1),skaf76(X1))),cons(skaf74(X1),skaf77(X1))) = X1
| ~ ssList(X1) ),
c_0_24 ).
cnf(c_0_28,axiom,
ssList(skaf77(X1)),
clause18 ).
cnf(c_0_29,axiom,
ssList(skaf76(X1)),
clause19 ).
cnf(c_0_30,axiom,
ssList(skaf75(X1)),
clause20 ).
cnf(c_0_31,plain,
~ lt(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_23])]) ).
cnf(c_0_32,plain,
( duplicatefreeP(X1)
| ~ ssList(X1)
| ~ strictorderedP(X1) ),
inference(sr,[status(thm)],[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_28]),c_0_29]),c_0_30])]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
strictorderedP(sk3),
co1_10 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_20]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC181-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n010.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:09:37 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.48 Running first-order theorem proving
% 0.23/0.48 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.23/0.54 # Version: 3.1.0
% 0.23/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # sh5l with pid 20552 completed with status 0
% 0.23/0.54 # Result found by sh5l
% 0.23/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.23/0.54 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.23/0.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 20558 completed with status 0
% 0.23/0.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.23/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.54 # Starting sh5l with 300s (1) cores
% 0.23/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.23/0.54 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.23/0.54 # Preprocessing time : 0.003 s
% 0.23/0.54 # Presaturation interreduction done
% 0.23/0.54
% 0.23/0.54 # Proof found!
% 0.23/0.54 # SZS status Unsatisfiable
% 0.23/0.54 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 199
% 0.23/0.55 # Removed by relevancy pruning/SinE : 25
% 0.23/0.55 # Initial clauses : 174
% 0.23/0.55 # Removed in clause preprocessing : 0
% 0.23/0.55 # Initial clauses in saturation : 174
% 0.23/0.55 # Processed clauses : 678
% 0.23/0.55 # ...of these trivial : 5
% 0.23/0.55 # ...subsumed : 120
% 0.23/0.55 # ...remaining for further processing : 553
% 0.23/0.55 # Other redundant clauses eliminated : 39
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 29
% 0.23/0.55 # Backward-rewritten : 43
% 0.23/0.55 # Generated clauses : 1031
% 0.23/0.55 # ...of the previous two non-redundant : 886
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 17
% 0.23/0.55 # Paramodulations : 987
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 45
% 0.23/0.55 # Disequality decompositions : 0
% 0.23/0.55 # Total rewrite steps : 996
% 0.23/0.55 # ...of those cached : 910
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 296
% 0.23/0.55 # Positive orientable unit clauses : 76
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 7
% 0.23/0.55 # Non-unit-clauses : 213
% 0.23/0.55 # Current number of unprocessed clauses: 527
% 0.23/0.55 # ...number of literals in the above : 2306
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 238
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 14289
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 4728
% 0.23/0.55 # Non-unit clause-clause subsumptions : 148
% 0.23/0.55 # Unit Clause-clause subsumption calls : 186
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 26
% 0.23/0.55 # BW rewrite match successes : 22
% 0.23/0.55 # Condensation attempts : 0
% 0.23/0.55 # Condensation successes : 0
% 0.23/0.55 # Termbank termtop insertions : 25341
% 0.23/0.55 # Search garbage collected termcells : 605
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.049 s
% 0.23/0.55 # System time : 0.008 s
% 0.23/0.55 # Total time : 0.057 s
% 0.23/0.55 # Maximum resident set size: 2232 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.051 s
% 0.23/0.55 # System time : 0.010 s
% 0.23/0.55 # Total time : 0.061 s
% 0.23/0.55 # Maximum resident set size: 1876 pages
% 0.23/0.55 % E---3.1 exiting
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------