%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN072+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 : n002.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.08s 10.39s
% Output : Proof 0.08s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel49_1,axiom,
? [X,Y] :
! [Z] :
( Z = Y
| Z = X ),
file('theBenchmark.p',pel49_1) ).
fof(pel49_2,axiom,
big_p(a),
file('theBenchmark.p',pel49_2) ).
fof(pel49_3,axiom,
big_p(b),
file('theBenchmark.p',pel49_3) ).
fof(pel49_4,axiom,
a != b,
file('theBenchmark.p',pel49_4) ).
fof(pel49,conjecture,
! [X] : big_p(X),
file('theBenchmark.p',pel49) ).
fof(f_1_1,plain,
? [X,Y] :
! [Z] :
( Z = Y
| Z = X ),
inference(fof_nnf,[status(thm)],[pel49_1]) ).
fof(f_1_2,plain,
? [U_2,U_1] :
! [U_0] :
( U_0 = U_1
| U_0 = U_2 ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
? [U_1] :
! [U_0] :
( U_0 = U_1
| U_0 = sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_1_2]) ).
fof(f_1_4,plain,
! [U_0] :
( U_0 = sK2
| U_0 = sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2)],[f_1_3]) ).
cnf(f_1_5,plain,
( U_0 = sK2
| U_0 = sK1 ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_2_1,plain,
big_p(a),
inference(fof_nnf,[status(thm)],[pel49_2]) ).
cnf(f_2_2,plain,
big_p(a),
inference(clausify,[status(thm)],[f_2_1]) ).
fof(f_3_1,plain,
big_p(b),
inference(fof_nnf,[status(thm)],[pel49_3]) ).
cnf(f_3_2,plain,
big_p(b),
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
a != b,
inference(fof_nnf,[status(thm)],[pel49_4]) ).
cnf(f_4_2,plain,
a != b,
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,negated_conjecture,
~ ! [X] : big_p(X),
inference(negate,[status(cth)],[pel49]) ).
fof(f_5_2,negated_conjecture,
? [X] : ~ big_p(X),
inference(fof_nnf,[status(thm)],[f_5_1]) ).
fof(f_5_3,negated_conjecture,
? [U_3] : ~ big_p(U_3),
inference(variable_rename,[status(thm)],[f_5_2]) ).
fof(f_5_4,negated_conjecture,
~ big_p(sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_3,sK3)],[f_5_3]) ).
fof(f_5_5,negated_conjecture,
~ big_p(sK3),
inference(definitional_conversion,[status(esa)],[f_5_4]) ).
cnf(f_5_6,negated_conjecture,
~ big_p(sK3),
inference(clausify,[status(thm)],[f_5_5]) ).
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,
( big_p(Eq_y_0)
| ~ big_p(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN072+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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/10.36 % Computer : n002.cluster.edu
% 0.08/10.36 % Model : x86_64 x86_64
% 0.08/10.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.36 % Memory : 8046.5625MB
% 0.08/10.36 % OS : Linux 6.8.0-71-generic
% 0.08/10.37 % CPULimit : 300
% 0.08/10.37 % WCLimit : 300
% 0.08/10.37 % DateTime : Sun Sep 20 06:26:58 UTC 2026
% 0.08/10.37 % CPUTime :
% 0.08/10.39 % SZS status Theorem for theBenchmark
% 0.08/10.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------