↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n017.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:30 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.62s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   28 (  20 unt;   8 nHn;  23 RR)
%            Number of literals    :   40 (  28 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   31 (   5 sgn)

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

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

cnf(premise_12,hypothesis,
    heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_12) ).

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

cnf(premise_11,hypothesis,
    x2 != x7,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_11) ).

cnf(premise_3,hypothesis,
    x1 != x10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_3) ).

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

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

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

cnf(c_0_9,plain,
    sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
    inference(spm,[status(thm)],[c_0_7,c_0_7]) ).

cnf(c_0_10,hypothesis,
    heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
    premise_12 ).

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

cnf(c_0_12,hypothesis,
    heap(sep(lseg(x7,x6),sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x10),sep(lseg(x5,x7),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)],[c_0_10,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_13,hypothesis,
    ( x10 = x2
    | x1 = x2 ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_15,hypothesis,
    ( heap(sep(lseg(x7,x6),sep(lseg(x2,x1),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x2),sep(lseg(x5,x7),emp))))))))
    | x1 = x2 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_16,hypothesis,
    ( x5 = x2
    | x1 = x2 ),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_17,hypothesis,
    x2 != x7,
    inference(fof_simplification,[status(thm)],[premise_11]) ).

cnf(c_0_18,hypothesis,
    ( heap(sep(lseg(x7,x6),sep(lseg(x2,x7),sep(lseg(x2,x1),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x2),emp)))))))
    | x1 = x2 ),
    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_15,c_0_16]),c_0_14]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_19,hypothesis,
    x2 != x7,
    c_0_17 ).

cnf(c_0_20,hypothesis,
    x1 != x10,
    inference(fof_simplification,[status(thm)],[premise_3]) ).

cnf(c_0_21,hypothesis,
    x1 = x2,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_19]) ).

cnf(c_0_22,hypothesis,
    x1 != x10,
    c_0_20 ).

cnf(c_0_23,hypothesis,
    heap(sep(lseg(x7,x6),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x2),sep(lseg(x3,x10),sep(lseg(x5,x7),emp)))))))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_14]) ).

cnf(c_0_24,hypothesis,
    x10 != x2,
    inference(rw,[status(thm)],[c_0_22,c_0_21]) ).

cnf(c_0_25,hypothesis,
    x5 = x2,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_24]) ).

cnf(c_0_26,hypothesis,
    heap(sep(lseg(x7,x6),sep(lseg(x2,x7),sep(lseg(x2,x10),sep(lseg(x6,x9),sep(lseg(x9,x2),sep(lseg(x3,x10),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(spm,[status(thm)],[c_0_12,c_0_25]),c_0_21]),c_0_14]),c_0_21]),c_0_14]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_27,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_26]),c_0_24]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW425-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55  % Computer : n017.cluster.edu
% 0.09/0.55  % Model    : x86_64 x86_64
% 0.09/0.55  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55  % Memory   : 8046.5625MB
% 0.09/0.55  % OS       : Linux 6.8.0-71-generic
% 0.09/0.55  % CPULimit : 300
% 0.09/0.55  % WCLimit  : 300
% 0.09/0.55  % DateTime : Mon Sep 21 09:47:43 UTC 2026
% 0.09/0.55  % CPUTime  : 
% 0.09/0.55  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.59  Running first-order theorem proving
% 0.14/0.59  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/benchmark/theBenchmark.p
% 0.14/0.62  % Version: 3.5.1
% 0.14/0.62  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.62  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.62  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.62  % Starting sh5l with 300s (1) cores
% 0.14/0.62  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2027909 completed with status 0
% 0.14/0.62  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.62  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.62  % No SInE strategy applied
% 0.14/0.62  % Search class: FGUSS-FFMF22-DFFFFFNN
% 0.14/0.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.62  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.62  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 0.14/0.62  % Starting new_bool_3 with 298s (1) cores
% 0.14/0.62  % Starting new_bool_1 with 291s (1) cores
% 0.14/0.62  % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2027915 completed with status 0
% 0.14/0.62  % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.14/0.62  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.62  % No SInE strategy applied
% 0.14/0.62  % Search class: FGUSS-FFMF22-DFFFFFNN
% 0.14/0.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.62  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.62  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.62  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 0.14/0.62  % Preprocessing time       : 0.002 s
% 0.14/0.62  
% 0.14/0.62  % Proof found!
% 0.14/0.62  % SZS status Unsatisfiable
% 0.14/0.62  % SZS output start CNFRefutation
% See solution above
% 0.14/0.62  % Parsed axioms                        : 24
% 0.14/0.62  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.62  % Initial clauses                      : 24
% 0.14/0.62  % Removed in clause preprocessing      : 1
% 0.14/0.62  % Initial clauses in saturation        : 23
% 0.14/0.62  % Processed clauses                    : 127
% 0.14/0.62  % ...of these trivial                  : 0
% 0.14/0.62  % ...subsumed                          : 76
% 0.14/0.62  % ...remaining for further processing  : 51
% 0.14/0.62  % Other redundant clauses eliminated   : 6
% 0.14/0.62  % Clauses deleted for lack of memory   : 0
% 0.14/0.62  % Backward-subsumed                    : 0
% 0.14/0.62  % Backward-rewritten                   : 8
% 0.14/0.62  % Generated clauses                    : 410
% 0.14/0.62  % ...of the previous two non-redundant : 379
% 0.14/0.62  % ...aggressively subsumed             : 0
% 0.14/0.62  % Contextual simplify-reflections      : 0
% 0.14/0.62  % Paramodulations                      : 380
% 0.14/0.62  % Factorizations                       : 24
% 0.14/0.62  % NegExts                              : 0
% 0.14/0.62  % Equation resolutions                 : 6
% 0.14/0.62  % Disequality decompositions           : 0
% 0.14/0.62  % Total rewrite steps                  : 69
% 0.14/0.62  % ...of those cached                   : 15
% 0.14/0.62  % Propositional unsat checks           : 0
% 0.14/0.62  %    Propositional check models        : 0
% 0.14/0.62  %    Propositional check unsatisfiable : 0
% 0.14/0.62  %    Propositional clauses             : 0
% 0.14/0.62  %    Propositional clauses after purity: 0
% 0.14/0.62  %    Propositional unsat core size     : 0
% 0.14/0.62  %    Propositional preprocessing time  : 0.000
% 0.14/0.62  %    Propositional encoding time       : 0.000
% 0.14/0.62  %    Propositional solver time         : 0.000
% 0.14/0.62  %    Success case prop preproc time    : 0.000
% 0.14/0.62  %    Success case prop encoding time   : 0.000
% 0.14/0.62  %    Success case prop solver time     : 0.000
% 0.14/0.62  % Current number of processed clauses  : 43
% 0.14/0.62  %    Positive orientable unit clauses  : 6
% 0.14/0.62  %    Positive unorientable unit clauses: 2
% 0.14/0.62  %    Negative unit clauses             : 19
% 0.14/0.62  %    Non-unit-clauses                  : 16
% 0.14/0.62  % Current number of unprocessed clauses: 275
% 0.14/0.62  % ...number of literals in the above   : 490
% 0.14/0.62  % Current number of archived formulas  : 0
% 0.14/0.62  % Current number of archived clauses   : 8
% 0.14/0.62  % Clause-clause subsumption calls (NU) : 155
% 0.14/0.62  % Rec. Clause-clause subsumption calls : 155
% 0.14/0.62  % Non-unit clause-clause subsumptions  : 20
% 0.14/0.62  % Unit Clause-clause subsumption calls : 83
% 0.14/0.62  % Rewrite failures with RHS unbound    : 0
% 0.14/0.62  % BW rewrite match attempts            : 48
% 0.14/0.62  % BW rewrite match successes           : 15
% 0.14/0.62  % Condensation attempts                : 0
% 0.14/0.62  % Condensation successes               : 0
% 0.14/0.62  % Termbank termtop insertions          : 4862
% 0.14/0.62  % Search garbage collected termcells   : 50
% 0.14/0.62  
% 0.14/0.62  % -------------------------------------------------
% 0.14/0.62  % User time                : 0.010 s
% 0.14/0.62  % System time              : 0.004 s
% 0.14/0.62  % Total time               : 0.015 s
% 0.14/0.62  % Maximum resident set size: 3404 pages
% 0.14/0.62  
% 0.14/0.62  % -------------------------------------------------
% 0.14/0.62  % User time                : 0.062 s
% 0.14/0.62  % System time              : 0.015 s
% 0.14/0.62  % Total time               : 0.077 s
% 0.14/0.62  % Maximum resident set size: 4608 pages
% 0.14/0.62  % E exiting
%------------------------------------------------------------------------------