%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL678+1.001 : TPTP v9.3.1. Released v4.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 08:49:50 AM UTC 2026
% Result : Theorem 0.04s 0.32s
% Output : Proof 0.04s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
! [X] : r1(X,X),
file('theBenchmark.p',reflexivity) ).
fof(transitivity,axiom,
! [X,Y,Z] :
( ( r1(Y,Z)
& r1(X,Y) )
=> r1(X,Z) ),
file('theBenchmark.p',transitivity) ).
fof(main,conjecture,
~ ? [X] :
~ ( ~ ! [Y] :
( ~ ! [X] :
( ~ ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) )
| $false
| ~ r1(X,Y) )
| $false ),
file('theBenchmark.p',main) ).
fof(f_1_1,plain,
! [X] : r1(X,X),
inference(fof_nnf,[status(thm)],[reflexivity]) ).
fof(f_1_2,plain,
! [U_0] : r1(U_0,U_0),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
r1(U_0,U_0),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [X,Y,Z] :
( r1(X,Z)
| ~ r1(Y,Z)
| ~ r1(X,Y) ),
inference(fof_nnf,[status(thm)],[transitivity]) ).
fof(f_2_2,plain,
! [U_3,U_2,U_1] :
( r1(U_3,U_1)
| ~ r1(U_2,U_1)
| ~ r1(U_3,U_2) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( r1(U_3,U_1)
| ~ r1(U_2,U_1)
| ~ r1(U_3,U_2) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,negated_conjecture,
? [X] :
~ ( ~ ! [Y] :
( ~ ! [X] :
( ~ ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
| ~ r1(Y,X) )
| $false
| ~ r1(X,Y) )
| $false ),
inference(negate,[status(cth)],[main]) ).
fof(f_3_2,negated_conjecture,
? [X] :
( ! [Y] :
( ? [X] :
( ! [Y] :
( p1(Y)
| ~ r1(X,Y) )
& ? [Y] :
( ~ p1(Y)
& r1(X,Y) )
& r1(Y,X) )
| $false
| ~ r1(X,Y) )
& ~ $false ),
inference(fof_nnf,[status(thm)],[f_3_1]) ).
fof(f_3_3,negated_conjecture,
? [U_8] :
( ! [U_7] :
( ? [U_6] :
( ! [U_5] :
( p1(U_5)
| ~ r1(U_6,U_5) )
& ? [U_4] :
( ~ p1(U_4)
& r1(U_6,U_4) )
& r1(U_7,U_6) )
| $false
| ~ r1(U_8,U_7) )
& ~ $false ),
inference(variable_rename,[status(thm)],[f_3_2]) ).
fof(f_3_4,negated_conjecture,
( ( ? [U_8] :
! [U_7] :
( ? [U_6] :
( ! [U_5] :
( p1(U_5)
| ~ r1(U_6,U_5) )
& ? [U_4] :
( ~ p1(U_4)
& r1(U_6,U_4) )
& r1(U_7,U_6) )
| ~ r1(U_8,U_7) )
| $false )
& ~ $false ),
inference(miniscope,[status(thm)],[f_3_3]) ).
fof(f_3_5,negated_conjecture,
( ( ! [U_7] :
( ? [U_6] :
( ! [U_5] :
( p1(U_5)
| ~ r1(U_6,U_5) )
& ? [U_4] :
( ~ p1(U_4)
& r1(U_6,U_4) )
& r1(U_7,U_6) )
| ~ r1(sK1,U_7) )
| $false )
& ~ $false ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1)],[f_3_4]) ).
fof(f_3_6,negated_conjecture,
( ( ! [U_7] :
( ( ! [U_5] :
( p1(U_5)
| ~ r1(sK2(U_7),U_5) )
& ? [U_4] :
( ~ p1(U_4)
& r1(sK2(U_7),U_4) )
& r1(U_7,sK2(U_7)) )
| ~ r1(sK1,U_7) )
| $false )
& ~ $false ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_6,sK2(U_7))],[f_3_5]) ).
fof(f_3_7,negated_conjecture,
( ( ! [U_7] :
( ( ! [U_5] :
( p1(U_5)
| ~ r1(sK2(U_7),U_5) )
& ~ p1(sK3(U_7))
& r1(sK2(U_7),sK3(U_7))
& r1(U_7,sK2(U_7)) )
| ~ r1(sK1,U_7) )
| $false )
& ~ $false ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_4,sK3(U_7))],[f_3_6]) ).
fof(f_3_8,negated_conjecture,
( ! [U_5,U_7] :
( p1(U_5)
| ~ r1(sK2(U_7),U_5)
| ~ sP0(U_5,U_7) )
& ! [U_5,U_7] :
( ~ p1(sK3(U_7))
| ~ sP0(U_5,U_7) )
& ! [U_5,U_7] :
( r1(sK2(U_7),sK3(U_7))
| ~ sP0(U_5,U_7) )
& ! [U_5,U_7] :
( r1(U_7,sK2(U_7))
| ~ sP0(U_5,U_7) )
& ! [U_5,U_7] :
( sP0(U_5,U_7)
| ~ r1(sK1,U_7)
| $false )
& ~ $false ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_3_7]) ).
cnf(f_3_9,negated_conjecture,
~ $false,
inference(clausify,[status(thm)],[f_3_8]) ).
cnf(f_3_10,negated_conjecture,
( sP0(U_5,U_7)
| ~ r1(sK1,U_7)
| $false ),
inference(clausify,[status(thm)],[f_3_8]) ).
cnf(f_3_11,negated_conjecture,
( r1(U_7,sK2(U_7))
| ~ sP0(U_5,U_7) ),
inference(clausify,[status(thm)],[f_3_8]) ).
cnf(f_3_12,negated_conjecture,
( r1(sK2(U_7),sK3(U_7))
| ~ sP0(U_5,U_7) ),
inference(clausify,[status(thm)],[f_3_8]) ).
cnf(f_3_13,negated_conjecture,
( ~ p1(sK3(U_7))
| ~ sP0(U_5,U_7) ),
inference(clausify,[status(thm)],[f_3_8]) ).
cnf(f_3_14,negated_conjecture,
( p1(U_5)
| ~ r1(sK2(U_7),U_5)
| ~ sP0(U_5,U_7) ),
inference(clausify,[status(thm)],[f_3_8]) ).
cnf(f_3_9_true,negated_conjecture,
$true,
inference(clause_is_true,[status(thm)],[f_3_9]) ).
cnf(f_3_10_simplified,negated_conjecture,
( sP0(U_5,U_7)
| ~ r1(sK1,U_7) ),
inference(simplify_clause,[status(thm)],[f_3_10]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ 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.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sat Sep 19 15:40:52 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.32 % SZS status Theorem for theBenchmark
% 0.04/0.32 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------