TSTP Solution File: SWW417-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWW417-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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:09:21 EDT 2023

% Result   : Timeout 0.42s 300.16s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   12 (   9 unt;   3 nHn;  10 RR)
%            Number of literals    :   18 (   7 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(unfolding_2,axiom,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    file('/export/starexec/sandbox/tmp/tmp.G7EroR8Udq/E---3.1_7009.p',unfolding_2) ).

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

cnf(premise_3,hypothesis,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    file('/export/starexec/sandbox/tmp/tmp.G7EroR8Udq/E---3.1_7009.p',premise_3) ).

cnf(premise_2,hypothesis,
    x2 != x1,
    file('/export/starexec/sandbox/tmp/tmp.G7EroR8Udq/E---3.1_7009.p',premise_2) ).

cnf(conclusion_1,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    file('/export/starexec/sandbox/tmp/tmp.G7EroR8Udq/E---3.1_7009.p',conclusion_1) ).

cnf(c_0_5,axiom,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    unfolding_2 ).

cnf(c_0_6,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    associative_commutative ).

cnf(c_0_7,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(lseg(X2,X3),sep(next(X1,X2),X4))) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,hypothesis,
    heap(sep(lseg(x2,nil),sep(next(x1,x2),emp))),
    premise_3 ).

cnf(c_0_9,hypothesis,
    x2 != x1,
    premise_2 ).

cnf(c_0_10,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    conclusion_1 ).

cnf(c_0_11,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SWW417-1 : TPTP v8.1.2. Released v5.2.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n002.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Oct  2 22:26:29 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.50  Running first-order theorem proving
% 0.21/0.50  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.G7EroR8Udq/E---3.1_7009.p
% 0.42/300.16  # Version: 3.1pre001
% 0.42/300.16  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.16  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/300.16  # Starting new_bool_3 with 300s (1) cores
% 0.42/300.16  # Starting new_bool_1 with 300s (1) cores
% 0.42/300.16  # Starting sh5l with 300s (1) cores
% 0.42/300.16  # new_bool_1 with pid 7169 completed with status 0
% 0.42/300.16  # Result found by new_bool_1
% 0.42/300.16  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.16  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/300.16  # Starting new_bool_3 with 300s (1) cores
% 0.42/300.16  # Starting new_bool_1 with 300s (1) cores
% 0.42/300.16  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/300.16  # Search class: FGUSS-FFSF22-MFFFFFNN
% 0.42/300.16  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/300.16  # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.42/300.16  # SAT001_MinMin_p005000_rr_RG with pid 7175 completed with status 0
% 0.42/300.16  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.42/300.16  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.16  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/300.16  # Starting new_bool_3 with 300s (1) cores
% 0.42/300.16  # Starting new_bool_1 with 300s (1) cores
% 0.42/300.16  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/300.16  # Search class: FGUSS-FFSF22-MFFFFFNN
% 0.42/300.16  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/300.16  # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.42/300.16  # Preprocessing time       : 0.001 s
% 0.42/300.16  # Presaturation interreduction done
% 0.42/300.16  
% 0.42/300.16  # Proof found!
% 0.42/300.16  # SZS status Unsatisfiable
% 0.42/300.16  # SZS output start CNFRefutation
% See solution above
% 0.42/300.16  # Parsed axioms                        : 15
% 0.42/300.16  # Removed by relevancy pruning/SinE    : 0
% 0.42/300.16  # Initial clauses                      : 15
% 0.42/300.16  # Removed in clause preprocessing      : 0
% 0.42/300.16  # Initial clauses in saturation        : 15
% 0.42/300.16  # Processed clauses                    : 237
% 0.42/300.16  # ...of these trivial                  : 0
% 0.42/300.16  # ...subsumed                          : 184
% 0.42/300.16  # ...remaining for further processing  : 53
% 0.42/300.16  # Other redundant clauses eliminated   : 0
% 0.42/300.16  # Clauses deleted for lack of memory   : 0
% 0.42/300.16  # Backward-subsumed                    : 0
% 0.42/300.16  # Backward-rewritten                   : 0
% 0.42/300.16  # Generated clauses                    : 428
% 0.42/300.16  # ...of the previous two non-redundant : 408
% 0.42/300.16  # ...aggressively subsumed             : 0
% 0.42/300.16  # Contextual simplify-reflections      : 0
% 0.42/300.16  # Paramodulations                      : 428
% 0.42/300.16  # Factorizations                       : 0
% 0.42/300.16  # NegExts                              : 0
% 0.42/300.16  # Equation resolutions                 : 0
% 0.42/300.16  # Total rewrite steps                  : 14
% 0.42/300.16  # Propositional unsat checks           : 0
% 0.42/300.16  #    Propositional check models        : 0
% 0.42/300.16  #    Propositional check unsatisfiable : 0
% 0.42/300.16  #    Propositional clauses             : 0
% 0.42/300.16  #    Propositional clauses after purity: 0
% 0.42/300.16  #    Propositional unsat core size     : 0
% 0.42/300.16  #    Propositional preprocessing time  : 0.000
% 0.42/300.16  #    Propositional encoding time       : 0.000
% 0.42/300.16  #    Propositional solver time         : 0.000
% 0.42/300.16  #    Success case prop preproc time    : 0.000
% 0.42/300.16  #    Success case prop encoding time   : 0.000
% 0.42/300.16  #    Success case prop solver time     : 0.000
% 0.42/300.16  # Current number of processed clauses  : 38
% 0.42/300.16  #    Positive orientable unit clauses  : 2
% 0.42/300.16  #    Positive unorientable unit clauses: 2
% 0.42/300.16  #    Negative unit clauses             : 14
% 0.42/300.16  #    Non-unit-clauses                  : 20
% 0.42/300.16  # Current number of unprocessed clauses: 192
% 0.42/300.16  # ...number of literals in the above   : 379
% 0.42/300.16  # Current number of archived formulas  : 0
% 0.42/300.16  # Current number of archived clauses   : 15
% 0.42/300.16  # Clause-clause subsumption calls (NU) : 240
% 0.42/300.16  # Rec. Clause-clause subsumption calls : 240
% 0.42/300.16  # Non-unit clause-clause subsumptions  : 58
% 0.42/300.16  # Unit Clause-clause subsumption calls : 7
% 0.42/300.16  # Rewrite failures with RHS unbound    : 0
% 0.42/300.16  # BW rewrite match attempts            : 50
% 0.42/300.16  # BW rewrite match successes           : 48
% 0.42/300.16  # Condensation attempts                : 0
% 0.42/300.16  # Condensation successes               : 0
% 0.42/300.16  # Termbank termtop insertions          : 5007
% 0.42/300.16  
% 0.42/300.16  # -------------------------------------------------
% 0.42/300.16  # User time                : 0.012 s
% 0.42/300.16  # System time              : 0.001 s
% 0.42/300.16  # Total time               : 0.014 s
% 0.42/300.16  # Maximum resident set size: 1624 pages
% 0.42/300.16  
% 0.42/300.16  # -------------------------------------------------
% 0.42/300.16  # User time                : 0.012 s
% 0.42/300.16  # System time              : 0.005 s
% 0.42/300.16  # Total time               : 0.017 s
% 0.42/300.16  # Maximum resident set size: 1688 pages
% 0.42/300.16  % E---3.1 exiting
% 0.42/300.16  % E---3.1 exiting
%------------------------------------------------------------------------------