TSTP Solution File: SWC264-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC264-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:09 EDT 2023
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 23 unt; 2 nHn; 22 RR)
% Number of literals : 69 ( 7 equ; 37 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 : 35 ( 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/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',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/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause164) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',co1_1) ).
cnf(co1_8,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',co1_8) ).
cnf(co1_7,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',co1_6) ).
cnf(clause30,axiom,
ssItem(skaf65(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause30) ).
cnf(clause31,axiom,
ssItem(skaf64(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause31) ).
cnf(clause27,axiom,
ssList(skaf68(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause27) ).
cnf(clause28,axiom,
ssList(skaf67(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause28) ).
cnf(clause29,axiom,
ssList(skaf66(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause29) ).
cnf(clause103,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause103) ).
cnf(clause91,axiom,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p',clause91) ).
cnf(c_0_13,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) ),
clause181 ).
cnf(c_0_14,axiom,
( totalorderedP(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| ~ ssList(X1) ),
clause164 ).
cnf(c_0_15,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_16,negated_conjecture,
~ totalorderedP(sk1),
co1_8 ).
cnf(c_0_17,negated_conjecture,
strictorderedP(sk3),
co1_7 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,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_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,axiom,
ssItem(skaf65(X1)),
clause30 ).
cnf(c_0_22,axiom,
ssItem(skaf64(X1)),
clause31 ).
cnf(c_0_23,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_24,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_25,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_26,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,axiom,
( leq(X1,X2)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause103 ).
cnf(c_0_28,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_19,c_0_20]),c_0_21]),c_0_22]),c_0_15]),c_0_23]),c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,axiom,
( totalorderedP(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| ~ ssList(X1) ),
clause91 ).
cnf(c_0_30,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_27,c_0_28]),c_0_21]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC264-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.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 : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:11:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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/tmp/tmp.ZQ1v9gUIgU/E---3.1_14779.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 14857 completed with status 0
% 0.21/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.21/0.53 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 14867 completed with status 0
% 0.21/0.53 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.21/0.53 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.21/0.53 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.21/0.53 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 193
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 193
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 193
% 0.21/0.53 # Processed clauses : 230
% 0.21/0.53 # ...of these trivial : 2
% 0.21/0.53 # ...subsumed : 6
% 0.21/0.53 # ...remaining for further processing : 222
% 0.21/0.53 # Other redundant clauses eliminated : 24
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 1441
% 0.21/0.53 # ...of the previous two non-redundant : 1418
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 2
% 0.21/0.53 # Paramodulations : 1418
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 24
% 0.21/0.53 # Total rewrite steps : 121
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 199
% 0.21/0.53 # Positive orientable unit clauses : 72
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 4
% 0.21/0.53 # Non-unit-clauses : 123
% 0.21/0.53 # Current number of unprocessed clauses: 1378
% 0.21/0.53 # ...number of literals in the above : 2975
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 0
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 5114
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 574
% 0.21/0.53 # Non-unit clause-clause subsumptions : 7
% 0.21/0.53 # Unit Clause-clause subsumption calls : 103
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 1
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 21292
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.027 s
% 0.21/0.53 # System time : 0.004 s
% 0.21/0.53 # Total time : 0.031 s
% 0.21/0.53 # Maximum resident set size: 2104 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.104 s
% 0.21/0.53 # System time : 0.017 s
% 0.21/0.53 # Total time : 0.122 s
% 0.21/0.53 # Maximum resident set size: 1864 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------