TSTP Solution File: SWC271-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC271-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:25:08 EDT 2024
% Result : Unsatisfiable 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 24 unt; 3 nHn; 27 RR)
% Number of literals : 89 ( 9 equ; 52 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause164,axiom,
( totalorderedP(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause164) ).
cnf(co1_10,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_8,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause103,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(clause30,axiom,
ssItem(skaf65(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause30) ).
cnf(clause31,axiom,
ssItem(skaf64(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause31) ).
cnf(clause27,axiom,
ssList(skaf68(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(clause28,axiom,
ssList(skaf67(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(clause29,axiom,
ssList(skaf66(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(clause91,axiom,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause91) ).
cnf(c_0_13,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_14,plain,
( totalorderedP(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause164]) ).
cnf(c_0_15,negated_conjecture,
~ totalorderedP(sk1),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_16,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_13 ).
cnf(c_0_17,plain,
( totalorderedP(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| ~ ssList(X1) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_19,negated_conjecture,
~ totalorderedP(sk1),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
strictorderedP(sk3),
co1_8 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_23,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_16]) ).
cnf(c_0_24,negated_conjecture,
app(app(skaf66(sk1),cons(skaf64(sk1),skaf67(sk1))),cons(skaf65(sk1),skaf68(sk1))) = sk1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,axiom,
ssItem(skaf65(X1)),
clause30 ).
cnf(c_0_26,axiom,
ssItem(skaf64(X1)),
clause31 ).
cnf(c_0_27,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_28,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_29,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_30,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,plain,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_32,plain,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_22 ).
cnf(c_0_33,negated_conjecture,
lt(skaf64(sk1),skaf65(sk1)),
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_23,c_0_24]),c_0_25]),c_0_26]),c_0_18]),c_0_27]),c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_34,plain,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
c_0_31 ).
cnf(c_0_35,negated_conjecture,
leq(skaf64(sk1),skaf65(sk1)),
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_26])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC271-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 03:16:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.18/0.49 # Version: 3.1.0
% 0.18/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.49 # Starting sh5l with 300s (1) cores
% 0.18/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 13642 completed with status 0
% 0.18/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.49 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/0.49 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.18/0.49 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 13653 completed with status 0
% 0.18/0.49 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.18/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.49 # No SInE strategy applied
% 0.18/0.49 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.49 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.18/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/0.49 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/0.49 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.18/0.49 # Preprocessing time : 0.002 s
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Unsatisfiable
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 195
% 0.18/0.49 # Removed by relevancy pruning/SinE : 0
% 0.18/0.49 # Initial clauses : 195
% 0.18/0.49 # Removed in clause preprocessing : 0
% 0.18/0.49 # Initial clauses in saturation : 195
% 0.18/0.49 # Processed clauses : 248
% 0.18/0.49 # ...of these trivial : 4
% 0.18/0.49 # ...subsumed : 7
% 0.18/0.49 # ...remaining for further processing : 237
% 0.18/0.49 # Other redundant clauses eliminated : 24
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 0
% 0.18/0.49 # Backward-rewritten : 0
% 0.18/0.49 # Generated clauses : 1454
% 0.18/0.49 # ...of the previous two non-redundant : 1430
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 2
% 0.18/0.49 # Paramodulations : 1431
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 24
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 150
% 0.18/0.49 # ...of those cached : 129
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 214
% 0.18/0.49 # Positive orientable unit clauses : 75
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 4
% 0.18/0.49 # Non-unit-clauses : 135
% 0.18/0.49 # Current number of unprocessed clauses: 1374
% 0.18/0.49 # ...number of literals in the above : 2958
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 0
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 6264
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 810
% 0.18/0.49 # Non-unit clause-clause subsumptions : 8
% 0.18/0.49 # Unit Clause-clause subsumption calls : 125
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 1
% 0.18/0.49 # BW rewrite match successes : 0
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 23673
% 0.18/0.49 # Search garbage collected termcells : 540
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.024 s
% 0.18/0.49 # System time : 0.007 s
% 0.18/0.49 # Total time : 0.031 s
% 0.18/0.49 # Maximum resident set size: 2144 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.126 s
% 0.18/0.49 # System time : 0.019 s
% 0.18/0.49 # Total time : 0.145 s
% 0.18/0.49 # Maximum resident set size: 1872 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------