%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWW423-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n015.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 09:07:49 AM UTC 2026
% Result : Unsatisfiable 208.93s 209.22s
% Output : Proof 208.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 11
% Syntax : Number of clauses : 56 ( 38 unt; 2 nHn; 54 RR)
% Number of literals : 89 ( 54 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associative_commutative,axiom,
sep(S,sep(T,Sigma)) = sep(T,sep(S,Sigma)),
file('SWV013-0.ax',associative_commutative) ).
cnf(unfolding_2,axiom,
( heap(sep(lseg(X,Z),Sigma))
| X = Y
| ~ heap(sep(next(X,Y),sep(lseg(Y,Z),Sigma))) ),
file('SWV013-0.ax',unfolding_2) ).
cnf(premise_2,hypothesis,
x2 != x1,
file('theBenchmark.p',premise_2) ).
cnf(premise_4,hypothesis,
heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp)))),
file('theBenchmark.p',premise_4) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))),
file('theBenchmark.p',conclusion_1) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sep(Eq_x_0,Eq_x_1) = sep(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( lseg(Eq_x_0,Eq_x_1) = lseg(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( heap(Eq_y_0)
| ~ heap(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))),
inference(start,[status(thm),parent(0:0)],[conclusion_1]) ).
cnf(t2,plain,
( x1 = x2
| ~ heap(sep(next(x1,x2),sep(lseg(x2,nil),sep(lseg(x3,nil),emp))))
| heap(sep(lseg(x1,nil),sep(lseg(x3,nil),emp))) ),
inference(extension,[status(thm),parent(t1:1)],[unfolding_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp))) != sep(next(x1,x2),sep(lseg(x2,nil),sep(lseg(x3,nil),emp)))
| ~ heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp))))
| heap(sep(next(x1,x2),sep(lseg(x2,nil),sep(lseg(x3,nil),emp)))) ),
inference(extension,[status(thm),parent(t2:2)],[equality_7]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
heap(sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp)))),
inference(extension,[status(thm),parent(t4:2)],[premise_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp))) != sep(lseg(x2,nil),sep(next(x1,x2),sep(lseg(x3,nil),emp)))
| sep(lseg(x2,nil),sep(next(x1,x2),sep(lseg(x3,nil),emp))) != sep(next(x1,x2),sep(lseg(x2,nil),sep(lseg(x3,nil),emp)))
| sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp))) = sep(next(x1,x2),sep(lseg(x2,nil),sep(lseg(x3,nil),emp))) ),
inference(extension,[status(thm),parent(t4:3)],[equality_3]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
sep(lseg(x2,nil),sep(next(x1,x2),sep(lseg(x3,nil),emp))) = sep(next(x1,x2),sep(lseg(x2,nil),sep(lseg(x3,nil),emp))),
inference(extension,[status(thm),parent(t8:2)],[associative_commutative]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( sep(lseg(x3,nil),sep(next(x1,x2),emp)) != sep(next(x1,x2),sep(lseg(x3,nil),emp))
| lseg(x2,nil) != lseg(x2,nil)
| sep(lseg(x2,nil),sep(lseg(x3,nil),sep(next(x1,x2),emp))) = sep(lseg(x2,nil),sep(next(x1,x2),sep(lseg(x3,nil),emp))) ),
inference(extension,[status(thm),parent(t8:3)],[equality_4]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
( nil != nil
| x2 != x2
| lseg(x2,nil) = lseg(x2,nil) ),
inference(extension,[status(thm),parent(t12:2)],[equality_5]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
x2 = x2,
inference(extension,[status(thm),parent(t14:2)],[equality_1]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
nil = nil,
inference(extension,[status(thm),parent(t14:3)],[equality_1]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t14:3]) ).
cnf(t20,plain,
( sep(lseg(x3,nil),sep(next(x1,x2),emp)) != sep(lseg(x3,nil),sep(next(x1,x2),emp))
| sep(lseg(x3,nil),sep(next(x1,x2),emp)) != sep(next(x1,x2),sep(lseg(x3,nil),emp))
| sep(lseg(x3,nil),sep(next(x1,x2),emp)) = sep(next(x1,x2),sep(lseg(x3,nil),emp)) ),
inference(extension,[status(thm),parent(t12:3)],[equality_3]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t12:3]) ).
cnf(t22,plain,
sep(lseg(x3,nil),sep(next(x1,x2),emp)) = sep(next(x1,x2),sep(lseg(x3,nil),emp)),
inference(extension,[status(thm),parent(t20:2)],[associative_commutative]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
sep(lseg(x3,nil),sep(next(x1,x2),emp)) = sep(lseg(x3,nil),sep(next(x1,x2),emp)),
inference(extension,[status(thm),parent(t20:3)],[equality_1]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).
cnf(t26,plain,
( x1 != x1
| x1 = x2
| x1 != x2 ),
inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t2:3]) ).
cnf(t28,plain,
( x2 != x1
| x2 = x2
| x1 != x2 ),
inference(extension,[status(thm),parent(t26:2)],[equality_3]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
cnf(t30,plain,
( x1 != x2
| x1 = x2
| x2 != x2 ),
inference(extension,[status(thm),parent(t28:2)],[equality_3]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).
cnf(t32,plain,
( x2 = x1
| x1 != x2 ),
inference(extension,[status(thm),parent(t30:2)],[equality_2]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).
cnf(t34,plain,
x2 != x1,
inference(extension,[status(thm),parent(t32:2)],[premise_2]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t32:2]) ).
cnf(t36,plain,
$false,
inference(reduction,[status(thm),parent(t30:3)],[t30:3,t26:2]) ).
cnf(t37,plain,
( x2 != x2
| x2 != x1
| x2 = x1 ),
inference(extension,[status(thm),parent(t28:3)],[equality_3]) ).
cnf(t38,plain,
$false,
inference(connection,[status(thm),parent(t37:1)],[t37:1,t28:3]) ).
cnf(t39,plain,
( x1 != x2
| x2 = x1 ),
inference(extension,[status(thm),parent(t37:2)],[equality_2]) ).
cnf(t40,plain,
$false,
inference(connection,[status(thm),parent(t39:1)],[t39:1,t37:2]) ).
cnf(t41,plain,
$false,
inference(reduction,[status(thm),parent(t39:2)],[t39:2,t26:2]) ).
cnf(t42,plain,
x2 = x2,
inference(extension,[status(thm),parent(t37:3)],[equality_1]) ).
cnf(t43,plain,
$false,
inference(connection,[status(thm),parent(t42:1)],[t42:1,t37:3]) ).
cnf(t44,plain,
x1 = x1,
inference(extension,[status(thm),parent(t26:3)],[equality_1]) ).
cnf(t45,plain,
$false,
inference(connection,[status(thm),parent(t44:1)],[t44:1,t26:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW423-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n015.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 05:36:07 UTC 2026
% 0.08/0.36 % CPUTime :
% 208.93/209.22 % SZS status Unsatisfiable for theBenchmark
% 208.93/209.22 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------