%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN071+1 : TPTP v9.3.1. Released v2.0.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 : n012.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:09:24 AM UTC 2026
% Result : Theorem 0.03s 0.31s
% Output : Proof 0.03s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel48_1,axiom,
( c = d
| a = b ),
file('theBenchmark.p',pel48_1) ).
fof(pel48_2,axiom,
( b = d
| a = c ),
file('theBenchmark.p',pel48_2) ).
fof(pel48,conjecture,
( b = c
| a = d ),
file('theBenchmark.p',pel48) ).
fof(f_1_1,plain,
( c = d
| a = b ),
inference(fof_nnf,[status(thm)],[pel48_1]) ).
cnf(f_1_2,plain,
( c = d
| a = b ),
inference(clausify,[status(thm)],[f_1_1]) ).
fof(f_2_1,plain,
( b = d
| a = c ),
inference(fof_nnf,[status(thm)],[pel48_2]) ).
cnf(f_2_2,plain,
( b = d
| a = c ),
inference(clausify,[status(thm)],[f_2_1]) ).
fof(f_3_1,negated_conjecture,
~ ( b = c
| a = d ),
inference(negate,[status(cth)],[pel48]) ).
fof(f_3_2,negated_conjecture,
( b != c
& a != d ),
inference(fof_nnf,[status(thm)],[f_3_1]) ).
fof(f_3_3,negated_conjecture,
( b != c
& a != d ),
inference(definitional_conversion,[status(esa)],[f_3_2]) ).
cnf(f_3_4,negated_conjecture,
a != d,
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,negated_conjecture,
b != c,
inference(clausify,[status(thm)],[f_3_3]) ).
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(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN071+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 This is a FOF_THM_EPR_PEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 20 06:24:06 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.31 % SZS status Theorem for theBenchmark
% 0.03/0.31 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------