TSTP Solution File: SWW445-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWW445-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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 20:11:18 EDT 2023
% Result : Timeout 301.16s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 15 unt; 16 nHn; 25 RR)
% Number of literals : 54 ( 37 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 17 con; 0-2 aty)
% Number of variables : 58 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.17lqPTdRbk/E---3.1_3569.p',wellformedness_5) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.17lqPTdRbk/E---3.1_3569.p',associative_commutative) ).
cnf(premise_19,hypothesis,
heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))),
file('/export/starexec/sandbox2/tmp/tmp.17lqPTdRbk/E---3.1_3569.p',premise_19) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.17lqPTdRbk/E---3.1_3569.p',normalization) ).
cnf(premise_3,hypothesis,
x3 != x20,
file('/export/starexec/sandbox2/tmp/tmp.17lqPTdRbk/E---3.1_3569.p',premise_3) ).
cnf(c_0_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
wellformedness_5 ).
cnf(c_0_6,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_7,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(X4,sep(lseg(X1,X3),X5)))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,hypothesis,
heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))),
premise_19 ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5)))) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_10,hypothesis,
heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x11),sep(lseg(x12,x15),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp))))))))))))))),
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(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(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(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(rw,[status(thm)],[c_0_8,c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_11,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_12,hypothesis,
( x12 = x20
| x11 = x12 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_14,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(X4,sep(X5,sep(lseg(X1,X2),sep(lseg(X1,X3),X6))))) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_15,hypothesis,
( x12 = x20
| heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp))))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_12]),c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(X4,sep(X5,sep(lseg(X1,X3),sep(X6,sep(lseg(X1,X2),X7)))))) ),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_17,plain,
sep(X1,sep(X2,sep(X3,sep(X4,X5)))) = sep(X3,sep(X2,sep(X4,sep(X1,X5)))),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_18,hypothesis,
( x12 = x20
| x15 = x12 ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_19,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(X4,sep(X5,sep(X6,sep(X7,sep(lseg(X1,X2),sep(lseg(X1,X3),X8))))))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
( x12 = x20
| heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_13]) ).
cnf(c_0_21,hypothesis,
x3 != x20,
premise_3 ).
cnf(c_0_22,hypothesis,
( x12 = x20
| x3 = x12 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,hypothesis,
( x15 = x12
| x11 = x12 ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_24,hypothesis,
( x12 = x20
| heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x20),sep(lseg(x12,x11),sep(lseg(x12,x15),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x11,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))))) ),
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_10,c_0_22]),c_0_13]),c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_25,hypothesis,
( x11 = x12
| heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x11),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_13]) ).
cnf(c_0_26,hypothesis,
x12 = x20,
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
cnf(c_0_27,hypothesis,
( x11 = x20
| heap(sep(lseg(x19,x1),sep(lseg(x20,x11),sep(lseg(x17,x14),sep(lseg(x4,x20),sep(lseg(x3,x20),sep(lseg(x3,x20),sep(lseg(x11,x20),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp))))))))))))) ),
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)],[c_0_25,c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_13]) ).
cnf(c_0_28,hypothesis,
x11 = x20,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_27]),c_0_21]) ).
cnf(c_0_29,hypothesis,
heap(sep(lseg(x19,x1),sep(lseg(x20,x15),sep(lseg(x17,x14),sep(lseg(x4,x20),sep(lseg(x3,x20),sep(lseg(x3,x20),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_28]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_26]),c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWW445-1 : TPTP v8.1.2. Released v5.2.0.
% 0.05/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 2400
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon Oct 2 22:57:04 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.38 Running first-order model finding
% 0.13/0.38 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.17lqPTdRbk/E---3.1_3569.p
% 301.16/300.11 # Version: 3.1pre001
% 301.16/300.11 # Preprocessing class: FSMSSMSMSSSNFFN.
% 301.16/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 301.16/300.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 301.16/300.11 # Starting new_bool_3 with 300s (1) cores
% 301.16/300.11 # Starting new_bool_1 with 300s (1) cores
% 301.16/300.11 # Starting sh5l with 300s (1) cores
% 301.16/300.11 # new_bool_3 with pid 3661 completed with status 0
% 301.16/300.11 # Result found by new_bool_3
% 301.16/300.11 # Preprocessing class: FSMSSMSMSSSNFFN.
% 301.16/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 301.16/300.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 301.16/300.11 # Starting new_bool_3 with 300s (1) cores
% 301.16/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 301.16/300.11 # Search class: FGUSS-FFSF22-DFFFFFNN
% 301.16/300.11 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 301.16/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 301.16/300.11 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 301.16/300.11 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 3665 completed with status 0
% 301.16/300.11 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 301.16/300.11 # Preprocessing class: FSMSSMSMSSSNFFN.
% 301.16/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 301.16/300.11 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 301.16/300.11 # Starting new_bool_3 with 300s (1) cores
% 301.16/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 301.16/300.11 # Search class: FGUSS-FFSF22-DFFFFFNN
% 301.16/300.11 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 301.16/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 301.16/300.11 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 301.16/300.11 # Preprocessing time : 0.001 s
% 301.16/300.11 # Presaturation interreduction done
% 301.16/300.11
% 301.16/300.11 # Proof found!
% 301.16/300.11 # SZS status Unsatisfiable
% 301.16/300.11 # SZS output start CNFRefutation
% See solution above
% 301.16/300.11 # Parsed axioms : 31
% 301.16/300.11 # Removed by relevancy pruning/SinE : 7
% 301.16/300.11 # Initial clauses : 24
% 301.16/300.11 # Removed in clause preprocessing : 1
% 301.16/300.11 # Initial clauses in saturation : 23
% 301.16/300.11 # Processed clauses : 1449
% 301.16/300.11 # ...of these trivial : 0
% 301.16/300.11 # ...subsumed : 1326
% 301.16/300.11 # ...remaining for further processing : 123
% 301.16/300.11 # Other redundant clauses eliminated : 0
% 301.16/300.11 # Clauses deleted for lack of memory : 0
% 301.16/300.11 # Backward-subsumed : 0
% 301.16/300.11 # Backward-rewritten : 16
% 301.16/300.11 # Generated clauses : 13990
% 301.16/300.11 # ...of the previous two non-redundant : 13956
% 301.16/300.11 # ...aggressively subsumed : 0
% 301.16/300.11 # Contextual simplify-reflections : 0
% 301.16/300.11 # Paramodulations : 13990
% 301.16/300.11 # Factorizations : 0
% 301.16/300.11 # NegExts : 0
% 301.16/300.11 # Equation resolutions : 0
% 301.16/300.11 # Total rewrite steps : 351
% 301.16/300.11 # Propositional unsat checks : 0
% 301.16/300.11 # Propositional check models : 0
% 301.16/300.11 # Propositional check unsatisfiable : 0
% 301.16/300.11 # Propositional clauses : 0
% 301.16/300.11 # Propositional clauses after purity: 0
% 301.16/300.11 # Propositional unsat core size : 0
% 301.16/300.11 # Propositional preprocessing time : 0.000
% 301.16/300.11 # Propositional encoding time : 0.000
% 301.16/300.11 # Propositional solver time : 0.000
% 301.16/300.11 # Success case prop preproc time : 0.000
% 301.16/300.11 # Success case prop encoding time : 0.000
% 301.16/300.11 # Success case prop solver time : 0.000
% 301.16/300.11 # Current number of processed clauses : 84
% 301.16/300.11 # Positive orientable unit clauses : 6
% 301.16/300.11 # Positive unorientable unit clauses: 21
% 301.16/300.11 # Negative unit clauses : 17
% 301.16/300.11 # Non-unit-clauses : 40
% 301.16/300.11 # Current number of unprocessed clauses: 12533
% 301.16/300.11 # ...number of literals in the above : 24967
% 301.16/300.11 # Current number of archived formulas : 0
% 301.16/300.11 # Current number of archived clauses : 39
% 301.16/300.11 # Clause-clause subsumption calls (NU) : 6339
% 301.16/300.11 # Rec. Clause-clause subsumption calls : 6334
% 301.16/300.11 # Non-unit clause-clause subsumptions : 910
% 301.16/300.11 # Unit Clause-clause subsumption calls : 316
% 301.16/300.11 # Rewrite failures with RHS unbound : 0
% 301.16/300.11 # BW rewrite match attempts : 1928
% 301.16/300.11 # BW rewrite match successes : 802
% 301.16/300.11 # Condensation attempts : 0
% 301.16/300.11 # Condensation successes : 0
% 301.16/300.11 # Termbank termtop insertions : 199588
% 301.16/300.11
% 301.16/300.11 # -------------------------------------------------
% 301.16/300.11 # User time : 0.209 s
% 301.16/300.11 # System time : 0.008 s
% 301.16/300.11 # Total time : 0.217 s
% 301.16/300.11 # Maximum resident set size: 1820 pages
% 301.16/300.11
% 301.16/300.11 # -------------------------------------------------
% 301.16/300.11 # User time : 0.210 s
% 301.16/300.11 # System time : 0.009 s
% 301.16/300.11 # Total time : 0.220 s
% 301.16/300.11 # Maximum resident set size: 1728 pages
% 301.16/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------