TSTP Solution File: SWW431-1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SWW431-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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 10:03:33 EDT 2024

% Result   : Unsatisfiable 0.14s 0.43s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   18 (  14 unt;   4 nHn;  13 RR)
%            Number of literals    :   26 (  17 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   14 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  13 con; 0-2 aty)
%            Number of variables   :   31 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
    file('/export/starexec/sandbox/tmp/tmp.5RN8oPvGqA/E---3.1_24554.p',wellformedness_5) ).

cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox/tmp/tmp.5RN8oPvGqA/E---3.1_24554.p',associative_commutative) ).

cnf(premise_13,hypothesis,
    heap(sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),sep(lseg(x2,x9),sep(lseg(x12,x7),sep(lseg(x9,x2),sep(lseg(x7,x10),sep(lseg(x11,x12),sep(lseg(x11,x7),sep(lseg(x11,x1),emp))))))))))))),
    file('/export/starexec/sandbox/tmp/tmp.5RN8oPvGqA/E---3.1_24554.p',premise_13) ).

cnf(premise_7,hypothesis,
    x7 != x11,
    file('/export/starexec/sandbox/tmp/tmp.5RN8oPvGqA/E---3.1_24554.p',premise_7) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox/tmp/tmp.5RN8oPvGqA/E---3.1_24554.p',normalization) ).

cnf(c_0_5,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_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(lseg(X1,X3),X4))) ),
    c_0_5 ).

cnf(c_0_8,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_9,hypothesis,
    heap(sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),sep(lseg(x2,x9),sep(lseg(x12,x7),sep(lseg(x9,x2),sep(lseg(x7,x10),sep(lseg(x11,x12),sep(lseg(x11,x7),sep(lseg(x11,x1),emp))))))))))))),
    premise_13 ).

cnf(c_0_10,hypothesis,
    x7 != x11,
    inference(fof_simplification,[status(thm)],[premise_7]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(X4,sep(lseg(X1,X2),sep(lseg(X1,X3),X5)))) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,hypothesis,
    heap(sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x12),sep(lseg(x11,x1),sep(lseg(x2,x9),sep(lseg(x9,x2),sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x12,x7),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),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)],[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(spm,[status(thm)],[c_0_9,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]),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_13,hypothesis,
    x7 != x11,
    c_0_10 ).

cnf(c_0_14,hypothesis,
    x12 = x11,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_15,axiom,
    sep(lseg(X1,X1),X2) = X2,
    normalization ).

cnf(c_0_16,hypothesis,
    heap(sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x7),sep(lseg(x11,x1),sep(lseg(x2,x9),sep(lseg(x9,x2),sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),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)],[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_9,c_0_14]),c_0_15]),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]),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_17,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem    : SWW431-1 : TPTP v8.1.2. Released v5.2.0.
% 0.05/0.13  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n032.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Fri May  3 13:16:39 EDT 2024
% 0.10/0.32  % CPUTime    : 
% 0.14/0.42  Running first-order model finding
% 0.14/0.42  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.5RN8oPvGqA/E---3.1_24554.p
% 0.14/0.43  # Version: 3.1.0
% 0.14/0.43  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  # Starting sh5l with 300s (1) cores
% 0.14/0.43  # new_bool_3 with pid 24632 completed with status 0
% 0.14/0.43  # Result found by new_bool_3
% 0.14/0.43  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.14/0.43  # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.14/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.14/0.43  # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 24638 completed with status 0
% 0.14/0.43  # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.14/0.43  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.14/0.43  # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.14/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.14/0.43  # Preprocessing time       : 0.001 s
% 0.14/0.43  # Presaturation interreduction done
% 0.14/0.43  
% 0.14/0.43  # Proof found!
% 0.14/0.43  # SZS status Unsatisfiable
% 0.14/0.43  # SZS output start CNFRefutation
% See solution above
% 0.14/0.43  # Parsed axioms                        : 25
% 0.14/0.43  # Removed by relevancy pruning/SinE    : 7
% 0.14/0.43  # Initial clauses                      : 18
% 0.14/0.43  # Removed in clause preprocessing      : 1
% 0.14/0.43  # Initial clauses in saturation        : 17
% 0.14/0.43  # Processed clauses                    : 65
% 0.14/0.43  # ...of these trivial                  : 13
% 0.14/0.43  # ...subsumed                          : 10
% 0.14/0.43  # ...remaining for further processing  : 42
% 0.14/0.43  # Other redundant clauses eliminated   : 0
% 0.14/0.43  # Clauses deleted for lack of memory   : 0
% 0.14/0.43  # Backward-subsumed                    : 0
% 0.14/0.43  # Backward-rewritten                   : 1
% 0.14/0.43  # Generated clauses                    : 129
% 0.14/0.43  # ...of the previous two non-redundant : 115
% 0.14/0.43  # ...aggressively subsumed             : 0
% 0.14/0.43  # Contextual simplify-reflections      : 0
% 0.14/0.43  # Paramodulations                      : 129
% 0.14/0.43  # Factorizations                       : 0
% 0.14/0.43  # NegExts                              : 0
% 0.14/0.43  # Equation resolutions                 : 0
% 0.14/0.43  # Disequality decompositions           : 0
% 0.14/0.43  # Total rewrite steps                  : 800
% 0.14/0.43  # ...of those cached                   : 656
% 0.14/0.43  # Propositional unsat checks           : 0
% 0.14/0.43  #    Propositional check models        : 0
% 0.14/0.43  #    Propositional check unsatisfiable : 0
% 0.14/0.43  #    Propositional clauses             : 0
% 0.14/0.43  #    Propositional clauses after purity: 0
% 0.14/0.43  #    Propositional unsat core size     : 0
% 0.14/0.43  #    Propositional preprocessing time  : 0.000
% 0.14/0.43  #    Propositional encoding time       : 0.000
% 0.14/0.43  #    Propositional solver time         : 0.000
% 0.14/0.43  #    Success case prop preproc time    : 0.000
% 0.14/0.43  #    Success case prop encoding time   : 0.000
% 0.14/0.43  #    Success case prop solver time     : 0.000
% 0.14/0.43  # Current number of processed clauses  : 24
% 0.14/0.43  #    Positive orientable unit clauses  : 5
% 0.14/0.43  #    Positive unorientable unit clauses: 2
% 0.14/0.43  #    Negative unit clauses             : 12
% 0.14/0.43  #    Non-unit-clauses                  : 5
% 0.14/0.43  # Current number of unprocessed clauses: 84
% 0.14/0.43  # ...number of literals in the above   : 192
% 0.14/0.43  # Current number of archived formulas  : 0
% 0.14/0.43  # Current number of archived clauses   : 18
% 0.14/0.43  # Clause-clause subsumption calls (NU) : 20
% 0.14/0.43  # Rec. Clause-clause subsumption calls : 20
% 0.14/0.43  # Non-unit clause-clause subsumptions  : 6
% 0.14/0.43  # Unit Clause-clause subsumption calls : 73
% 0.14/0.43  # Rewrite failures with RHS unbound    : 0
% 0.14/0.43  # BW rewrite match attempts            : 35
% 0.14/0.43  # BW rewrite match successes           : 19
% 0.14/0.43  # Condensation attempts                : 0
% 0.14/0.43  # Condensation successes               : 0
% 0.14/0.43  # Termbank termtop insertions          : 3713
% 0.14/0.43  # Search garbage collected termcells   : 82
% 0.14/0.43  
% 0.14/0.43  # -------------------------------------------------
% 0.14/0.43  # User time                : 0.009 s
% 0.14/0.43  # System time              : 0.000 s
% 0.14/0.43  # Total time               : 0.009 s
% 0.14/0.43  # Maximum resident set size: 1776 pages
% 0.14/0.43  
% 0.14/0.43  # -------------------------------------------------
% 0.14/0.43  # User time                : 0.012 s
% 0.14/0.43  # System time              : 0.000 s
% 0.14/0.43  # Total time               : 0.012 s
% 0.14/0.43  # Maximum resident set size: 1724 pages
% 0.14/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------