↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWW400-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:10:27 PM UTC 2026

% Result   : Unsatisfiable 1.60s 0.75s
% Output   : CNFRefutation 1.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  15 unt;   5 nHn;  20 RR)
%            Number of literals    :   38 (  12 equ;  15 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   :   41 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(unfolding_2,axiom,
    ( ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4)))
    | heap(sep(lseg(X1,X3),X4))
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).

cnf(unfolding_3,axiom,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3)))
    | heap(sep(lseg(X1,nil),X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_3) ).

cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

cnf(premise_3,hypothesis,
    heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_3) ).

cnf(premise_2,hypothesis,
    nil != x2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).

cnf(conclusion_1,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_1) ).

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

cnf(c_0_8,plain,
    ( ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4)))
    | heap(sep(lseg(X1,X3),X4))
    | X1 = X2 ),
    c_0_7 ).

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

cnf(c_0_10,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3)))
    | heap(sep(lseg(X1,nil),X3)) ),
    inference(fof_simplification,[status(thm)],[unfolding_3]) ).

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

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

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

cnf(c_0_14,hypothesis,
    nil != x2,
    inference(fof_simplification,[status(thm)],[premise_2]) ).

cnf(c_0_15,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3)))
    | heap(sep(lseg(X1,nil),X3)) ),
    c_0_10 ).

cnf(c_0_16,plain,
    ( ~ heap(sep(X3,sep(next(X1,X2),X4)))
    | heap(sep(lseg(X1,X2),sep(X3,X4)))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,hypothesis,
    heap(sep(lseg(x1,x2),sep(next(x2,nil),emp))),
    inference(rw,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_18,hypothesis,
    nil != x2,
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(fof_simplification,[status(thm)],[conclusion_1]) ).

cnf(c_0_20,plain,
    ( ~ heap(sep(lseg(X3,nil),sep(lseg(X1,X3),X2)))
    | heap(sep(lseg(X1,nil),X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_12]) ).

cnf(c_0_21,hypothesis,
    heap(sep(lseg(x2,nil),sep(lseg(x1,x2),emp))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    c_0_19 ).

cnf(c_0_23,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW400-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n001.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 09:56:30 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45  Running first-order theorem proving
% 0.16/0.45  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.60/0.75  % Version: 3.5.1
% 1.60/0.75  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.60/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.60/0.75  % Starting new_bool_3 with 300s (1) cores
% 1.60/0.75  % Starting new_bool_1 with 300s (1) cores
% 1.60/0.75  % Starting sh5l with 300s (1) cores
% 1.60/0.75  % new_bool_3 with pid 2831378 completed with status 0
% 1.60/0.75  % Result found by new_bool_3
% 1.60/0.75  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.60/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.60/0.75  % Starting new_bool_3 with 300s (1) cores
% 1.60/0.75  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.60/0.75  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.60/0.75  % Search class: FGUSS-FFSF22-MFFFFFNN
% 1.60/0.75  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.60/0.75  % Starting SubtermCWHack with 31s (1) cores
% 1.60/0.75  % SubtermCWHack with pid 2831381 completed with status 0
% 1.60/0.75  % Result found by SubtermCWHack
% 1.60/0.75  % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.60/0.75  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.60/0.75  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.60/0.75  % Starting new_bool_3 with 300s (1) cores
% 1.60/0.75  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.60/0.75  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.60/0.75  % Search class: FGUSS-FFSF22-MFFFFFNN
% 1.60/0.75  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.60/0.75  % Starting SubtermCWHack with 31s (1) cores
% 1.60/0.75  % Preprocessing time       : 0.002 s
% 1.60/0.75  
% 1.60/0.75  % Proof found!
% 1.60/0.75  % SZS status Unsatisfiable
% 1.60/0.75  % SZS output start CNFRefutation
% See solution above
% 1.60/0.75  % Parsed axioms                        : 15
% 1.60/0.75  % Removed by relevancy pruning/SinE    : 0
% 1.60/0.75  % Initial clauses                      : 15
% 1.60/0.75  % Removed in clause preprocessing      : 0
% 1.60/0.75  % Initial clauses in saturation        : 15
% 1.60/0.75  % Processed clauses                    : 1145
% 1.60/0.75  % ...of these trivial                  : 0
% 1.60/0.75  % ...subsumed                          : 1045
% 1.60/0.75  % ...remaining for further processing  : 100
% 1.60/0.75  % Other redundant clauses eliminated   : 0
% 1.60/0.75  % Clauses deleted for lack of memory   : 0
% 1.60/0.75  % Backward-subsumed                    : 0
% 1.60/0.75  % Backward-rewritten                   : 1
% 1.60/0.75  % Generated clauses                    : 9921
% 1.60/0.75  % ...of the previous two non-redundant : 9878
% 1.60/0.75  % ...aggressively subsumed             : 0
% 1.60/0.75  % Contextual simplify-reflections      : 0
% 1.60/0.75  % Paramodulations                      : 9921
% 1.60/0.75  % Factorizations                       : 0
% 1.60/0.75  % NegExts                              : 0
% 1.60/0.75  % Equation resolutions                 : 0
% 1.60/0.75  % Disequality decompositions           : 0
% 1.60/0.75  % Total rewrite steps                  : 130
% 1.60/0.75  % ...of those cached                   : 60
% 1.60/0.75  % Propositional unsat checks           : 0
% 1.60/0.75  %    Propositional check models        : 0
% 1.60/0.75  %    Propositional check unsatisfiable : 0
% 1.60/0.75  %    Propositional clauses             : 0
% 1.60/0.75  %    Propositional clauses after purity: 0
% 1.60/0.75  %    Propositional unsat core size     : 0
% 1.60/0.75  %    Propositional preprocessing time  : 0.000
% 1.60/0.75  %    Propositional encoding time       : 0.000
% 1.60/0.75  %    Propositional solver time         : 0.000
% 1.60/0.75  %    Success case prop preproc time    : 0.000
% 1.60/0.75  %    Success case prop encoding time   : 0.000
% 1.60/0.75  %    Success case prop solver time     : 0.000
% 1.60/0.75  % Current number of processed clauses  : 99
% 1.60/0.75  %    Positive orientable unit clauses  : 3
% 1.60/0.75  %    Positive unorientable unit clauses: 13
% 1.60/0.75  %    Negative unit clauses             : 23
% 1.60/0.75  %    Non-unit-clauses                  : 60
% 1.60/0.75  % Current number of unprocessed clauses: 8748
% 1.60/0.75  % ...number of literals in the above   : 15655
% 1.60/0.75  % Current number of archived formulas  : 0
% 1.60/0.75  % Current number of archived clauses   : 1
% 1.60/0.75  % Clause-clause subsumption calls (NU) : 1359
% 1.60/0.75  % Rec. Clause-clause subsumption calls : 1359
% 1.60/0.75  % Non-unit clause-clause subsumptions  : 220
% 1.60/0.75  % Unit Clause-clause subsumption calls : 50
% 1.60/0.75  % Rewrite failures with RHS unbound    : 0
% 1.60/0.75  % BW rewrite match attempts            : 1668
% 1.60/0.75  % BW rewrite match successes           : 680
% 1.60/0.75  % Condensation attempts                : 0
% 1.60/0.75  % Condensation successes               : 0
% 1.60/0.75  % Termbank termtop insertions          : 128811
% 1.60/0.75  % Search garbage collected termcells   : 31
% 1.60/0.75  
% 1.60/0.75  % -------------------------------------------------
% 1.60/0.75  % User time                : 0.244 s
% 1.60/0.75  % System time              : 0.014 s
% 1.60/0.75  % Total time               : 0.258 s
% 1.60/0.75  % Maximum resident set size: 3648 pages
% 1.60/0.75  
% 1.60/0.75  % -------------------------------------------------
% 1.60/0.75  % User time                : 0.247 s
% 1.60/0.75  % System time              : 0.020 s
% 1.60/0.75  % Total time               : 0.267 s
% 1.60/0.75  % Maximum resident set size: 4608 pages
% 1.60/0.75  % E exiting
%------------------------------------------------------------------------------