TSTP Solution File: SWW443-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWW443-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Unsatisfiable 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 20 unt; 13 nHn; 29 RR)
% Number of literals : 54 ( 39 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 15 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-2 aty)
% Number of variables : 28 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(premise_23,hypothesis,
heap(sep(lseg(x10,x1),sep(lseg(x18,x15),sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x12,x13),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x9,x5),sep(lseg(x7,x5),sep(lseg(x11,x9),sep(lseg(x11,x7),emp)))))))))))))),
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',premise_23) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',associative_commutative) ).
cnf(wellformedness_5,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',wellformedness_5) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',normalization) ).
cnf(premise_19,hypothesis,
x1 != x14,
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',premise_19) ).
cnf(premise_8,hypothesis,
x2 != x8,
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',premise_8) ).
cnf(premise_22,hypothesis,
x5 != x15,
file('/export/starexec/sandbox2/tmp/tmp.2MLfI2jqvy/E---3.1_8808.p',premise_22) ).
cnf(c_0_7,hypothesis,
heap(sep(lseg(x10,x1),sep(lseg(x18,x15),sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x12,x13),sep(lseg(x2,x5),sep(lseg(x2,x12),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x9,x5),sep(lseg(x7,x5),sep(lseg(x11,x9),sep(lseg(x11,x7),emp)))))))))))))),
premise_23 ).
cnf(c_0_8,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_9,axiom,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
wellformedness_5 ).
cnf(c_0_10,hypothesis,
heap(sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x2,x5),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x18,x15),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x5),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x10,x1),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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(X4,sep(lseg(X1,X3),X5)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,hypothesis,
( x14 = x1
| x3 = x1 ),
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(lseg(X1,X3),sep(lseg(X1,X2),X5)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_15,hypothesis,
( x14 = x1
| heap(sep(lseg(x1,x14),sep(lseg(x2,x5),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x18,x15),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x5),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x10,x1),emp))))))))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_12]),c_0_13]) ).
cnf(c_0_16,hypothesis,
( x14 = x1
| x5 = x2
| x18 = x2 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,hypothesis,
( x18 = x2
| x5 = x2 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_13]),c_0_14]) ).
cnf(c_0_18,hypothesis,
( x5 = x2
| x14 = x1
| heap(sep(lseg(x1,x14),sep(lseg(x2,x5),sep(lseg(x2,x15),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x5),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x10,x1),emp)))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_13]),c_0_8]),c_0_8]) ).
cnf(c_0_19,hypothesis,
( x5 = x2
| heap(sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x2,x5),sep(lseg(x2,x15),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x5),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x10,x1),emp))))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_13]),c_0_8]),c_0_8]) ).
cnf(c_0_20,hypothesis,
( x14 = x1
| x5 = x2
| x15 = x2 ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_21,hypothesis,
x1 != x14,
premise_19 ).
cnf(c_0_22,hypothesis,
( x14 = x1
| x5 = x2
| heap(sep(lseg(x1,x14),sep(lseg(x1,x3),sep(lseg(x2,x5),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x5),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x10,x1),emp)))))))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13]) ).
cnf(c_0_23,hypothesis,
x3 = x1,
inference(sr,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_24,hypothesis,
( x5 = x2
| heap(sep(lseg(x1,x14),sep(lseg(x2,x5),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x5),sep(lseg(x12,x13),sep(lseg(x7,x5),sep(lseg(x10,x1),emp))))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_22,c_0_21]),c_0_23]),c_0_13]) ).
cnf(c_0_25,hypothesis,
x2 != x8,
premise_8 ).
cnf(c_0_26,hypothesis,
x5 = x2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_24]),c_0_25]) ).
cnf(c_0_27,hypothesis,
heap(sep(lseg(x1,x14),sep(lseg(x2,x18),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x18,x15),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x2),sep(lseg(x12,x13),sep(lseg(x7,x2),sep(lseg(x10,x1),emp)))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_26]),c_0_23]),c_0_13]),c_0_13]) ).
cnf(c_0_28,hypothesis,
x18 = x2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_27]),c_0_25]) ).
cnf(c_0_29,hypothesis,
x5 != x15,
premise_22 ).
cnf(c_0_30,hypothesis,
heap(sep(lseg(x1,x14),sep(lseg(x2,x15),sep(lseg(x2,x8),sep(lseg(x2,x12),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x9,x2),sep(lseg(x12,x13),sep(lseg(x7,x2),sep(lseg(x10,x1),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_23]),c_0_26]),c_0_13]),c_0_8]),c_0_26]),c_0_26]),c_0_13]),c_0_13]),c_0_8]) ).
cnf(c_0_31,hypothesis,
x15 != x2,
inference(rw,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_30]),c_0_25]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW443-1 : TPTP v8.1.2. Released v5.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 22:53:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.2MLfI2jqvy/E---3.1_8808.p
% 0.20/0.50 # Version: 3.1pre001
% 0.20/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # new_bool_3 with pid 8893 completed with status 0
% 0.20/0.50 # Result found by new_bool_3
% 0.20/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.20/0.50 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.20/0.50 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 8898 completed with status 0
% 0.20/0.50 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.20/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.20/0.50 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.20/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Unsatisfiable
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 35
% 0.20/0.50 # Removed by relevancy pruning/SinE : 7
% 0.20/0.50 # Initial clauses : 28
% 0.20/0.50 # Removed in clause preprocessing : 1
% 0.20/0.50 # Initial clauses in saturation : 27
% 0.20/0.50 # Processed clauses : 113
% 0.20/0.50 # ...of these trivial : 4
% 0.20/0.50 # ...subsumed : 24
% 0.20/0.50 # ...remaining for further processing : 85
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 2
% 0.20/0.50 # Backward-rewritten : 14
% 0.20/0.50 # Generated clauses : 138
% 0.20/0.50 # ...of the previous two non-redundant : 137
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 131
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Total rewrite steps : 133
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 35
% 0.20/0.50 # Positive orientable unit clauses : 8
% 0.20/0.50 # Positive unorientable unit clauses: 2
% 0.20/0.50 # Negative unit clauses : 21
% 0.20/0.50 # Non-unit-clauses : 4
% 0.20/0.50 # Current number of unprocessed clauses: 65
% 0.20/0.50 # ...number of literals in the above : 129
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 50
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 113
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 88
% 0.20/0.50 # Non-unit clause-clause subsumptions : 23
% 0.20/0.50 # Unit Clause-clause subsumption calls : 284
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 51
% 0.20/0.50 # BW rewrite match successes : 27
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3127
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1828 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.010 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.016 s
% 0.20/0.50 # Maximum resident set size: 1716 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------