%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWW399-1 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n016.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 : Tue May 5 05:32:16 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.71s
% Output : CNFRefutation 1.23s
% 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 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/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(premise_2,hypothesis,
heap(sep(next(x1,nil),emp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_2) ).
cnf(premise_1,hypothesis,
nil != x1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_1) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x1,nil),emp)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.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(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_7,plain,
( X1 = X2
| heap(sep(lseg(X1,X2),X3))
| ~ heap(sep(next(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,hypothesis,
heap(sep(next(x1,nil),emp)),
premise_2 ).
cnf(c_0_9,hypothesis,
nil != x1,
premise_1 ).
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.00/0.11 % Problem : SWW399-1 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.11 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32 % Computer : n016.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 06:46:06 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------