TSTP Solution File: SWW427-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : SWW427-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n018.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 : Mon Jun 24 18:14:31 EDT 2024
% Result : Unsatisfiable 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 28 ( 19 unt; 9 nHn; 24 RR)
% Number of literals : 40 ( 28 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 22 ( 3 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.eRKy5mESBe/E---3.1_25713.p',wellformedness_5) ).
cnf(premise_10,hypothesis,
heap(sep(lseg(x10,x1),sep(lseg(x9,x2),sep(lseg(x9,x7),sep(lseg(x7,x10),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x4,x5),emp)))))))))),
file('/export/starexec/sandbox2/tmp/tmp.eRKy5mESBe/E---3.1_25713.p',premise_10) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.eRKy5mESBe/E---3.1_25713.p',associative_commutative) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.eRKy5mESBe/E---3.1_25713.p',normalization) ).
cnf(premise_8,hypothesis,
x7 != x9,
file('/export/starexec/sandbox2/tmp/tmp.eRKy5mESBe/E---3.1_25713.p',premise_8) ).
cnf(premise_2,hypothesis,
x1 != x11,
file('/export/starexec/sandbox2/tmp/tmp.eRKy5mESBe/E---3.1_25713.p',premise_2) ).
cnf(c_0_6,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
inference(fof_simplification,[status(thm)],[wellformedness_5]) ).
cnf(c_0_7,hypothesis,
heap(sep(lseg(x10,x1),sep(lseg(x9,x2),sep(lseg(x9,x7),sep(lseg(x7,x10),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x4,x5),emp)))))))))),
premise_10 ).
cnf(c_0_8,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_9,plain,
( X1 = X2
| X1 = X3
| ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
c_0_6 ).
cnf(c_0_10,hypothesis,
heap(sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x9,x7),sep(lseg(x9,x2),sep(lseg(x4,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)],[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]) ).
cnf(c_0_11,hypothesis,
( x7 = x11
| x9 = x11 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_13,hypothesis,
( x7 = x11
| heap(sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x2),sep(lseg(x4,x5),sep(lseg(x10,x1),emp))))))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,hypothesis,
( x7 = x11
| heap(sep(lseg(x11,x7),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x2),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x4,x5),sep(lseg(x10,x1),emp))))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_15,hypothesis,
x7 = x11,
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_16,hypothesis,
heap(sep(lseg(x11,x9),sep(lseg(x11,x3),sep(lseg(x11,x10),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x4,x5),sep(lseg(x10,x1),emp))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_8]),c_0_12]) ).
cnf(c_0_17,hypothesis,
( x9 = x11
| x3 = x11 ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_18,hypothesis,
x7 != x9,
inference(fof_simplification,[status(thm)],[premise_8]) ).
cnf(c_0_19,hypothesis,
( x9 = x11
| heap(sep(lseg(x11,x9),sep(lseg(x11,x10),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x4,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(spm,[status(thm)],[c_0_10,c_0_17]),c_0_15]),c_0_12]),c_0_15]),c_0_15]),c_0_8]),c_0_12]) ).
cnf(c_0_20,hypothesis,
x7 != x9,
c_0_18 ).
cnf(c_0_21,hypothesis,
( x9 = x11
| x10 = x11 ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,hypothesis,
x9 != x11,
inference(rw,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_23,hypothesis,
x10 = x11,
inference(sr,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,hypothesis,
x1 != x11,
inference(fof_simplification,[status(thm)],[premise_2]) ).
cnf(c_0_25,hypothesis,
heap(sep(lseg(x11,x9),sep(lseg(x11,x1),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x4,x5),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(sr,[status(thm)],[c_0_19,c_0_22]),c_0_23]),c_0_23]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_12]) ).
cnf(c_0_26,hypothesis,
x1 != x11,
c_0_24 ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_25]),c_0_26]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW427-1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.12 % Command : run_E %s %d SAT
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jun 19 08:28:54 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 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.eRKy5mESBe/E---3.1_25713.p
% 0.21/0.48 # Version: 3.2.0
% 0.21/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_3 with pid 25791 completed with status 0
% 0.21/0.48 # Result found by new_bool_3
% 0.21/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.21/0.48 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.21/0.48 # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 25796 completed with status 0
% 0.21/0.48 # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.21/0.48 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.21/0.48 # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Unsatisfiable
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 22
% 0.21/0.48 # Removed by relevancy pruning/SinE : 7
% 0.21/0.48 # Initial clauses : 15
% 0.21/0.48 # Removed in clause preprocessing : 1
% 0.21/0.48 # Initial clauses in saturation : 14
% 0.21/0.48 # Processed clauses : 65
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 17
% 0.21/0.48 # ...remaining for further processing : 48
% 0.21/0.48 # Other redundant clauses eliminated : 0
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 0
% 0.21/0.48 # Backward-rewritten : 13
% 0.21/0.48 # Generated clauses : 73
% 0.21/0.48 # ...of the previous two non-redundant : 68
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 69
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 0
% 0.21/0.48 # Disequality decompositions : 0
% 0.21/0.48 # Total rewrite steps : 154
% 0.21/0.48 # ...of those cached : 94
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 17
% 0.21/0.48 # Positive orientable unit clauses : 7
% 0.21/0.48 # Positive unorientable unit clauses: 1
% 0.21/0.48 # Negative unit clauses : 6
% 0.21/0.48 # Non-unit-clauses : 3
% 0.21/0.48 # Current number of unprocessed clauses: 28
% 0.21/0.48 # ...number of literals in the above : 59
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 31
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 56
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 56
% 0.21/0.48 # Non-unit clause-clause subsumptions : 15
% 0.21/0.48 # Unit Clause-clause subsumption calls : 21
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 31
% 0.21/0.48 # BW rewrite match successes : 16
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 1990
% 0.21/0.48 # Search garbage collected termcells : 76
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.006 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.007 s
% 0.21/0.48 # Maximum resident set size: 1760 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.008 s
% 0.21/0.48 # System time : 0.002 s
% 0.21/0.48 # Total time : 0.010 s
% 0.21/0.48 # Maximum resident set size: 1756 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.48 % E exiting
%------------------------------------------------------------------------------