%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL656+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 : n006.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:43 AM UTC 2026
% Result : Theorem 0.13s 5.61s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
! [X] : r1(X,X),
file('theBenchmark.p',reflexivity) ).
fof(main,conjecture,
~ ? [X] :
~ ( ~ ( p100(X)
& ~ p101(X)
& ! [Y] :
( ( ( ~ p101(Y)
| p100(Y) )
& ( ~ p102(Y)
| p101(Y) )
& ( ~ p100(Y)
| ( ( ~ p1(Y)
| ! [X] :
( ~ p100(X)
| p1(X)
| ~ r1(Y,X) ) )
& ( p1(Y)
| ! [X] :
( ~ p100(X)
| ~ p1(X)
| ~ r1(Y,X) ) ) ) )
& ( ~ p101(Y)
| ( ( ~ p2(Y)
| ! [X] :
( ~ p101(X)
| p2(X)
| ~ r1(Y,X) ) )
& ( p2(Y)
| ! [X] :
( ~ p101(X)
| ~ p2(X)
| ~ r1(Y,X) ) ) ) )
& ( ~ ( p100(Y)
& ~ p101(Y) )
| ( ~ ! [X] :
( ~ ( p101(X)
& ~ p102(X)
& p2(X) )
| ~ r1(Y,X) )
& ~ ! [X] :
( ~ ( p101(X)
& ~ p102(X)
& ~ p2(X) )
| ~ r1(Y,X) ) ) ) )
| ~ r1(X,Y) ) )
| ~ ! [Y] :
( p2(Y)
| ~ r1(X,Y) ) ),
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,negated_conjecture,
? [X] :
~ ( ~ ( p100(X)
& ~ p101(X)
& ! [Y] :
( ( ( ~ p101(Y)
| p100(Y) )
& ( ~ p102(Y)
| p101(Y) )
& ( ~ p100(Y)
| ( ( ~ p1(Y)
| ! [X] :
( ~ p100(X)
| p1(X)
| ~ r1(Y,X) ) )
& ( p1(Y)
| ! [X] :
( ~ p100(X)
| ~ p1(X)
| ~ r1(Y,X) ) ) ) )
& ( ~ p101(Y)
| ( ( ~ p2(Y)
| ! [X] :
( ~ p101(X)
| p2(X)
| ~ r1(Y,X) ) )
& ( p2(Y)
| ! [X] :
( ~ p101(X)
| ~ p2(X)
| ~ r1(Y,X) ) ) ) )
& ( ~ ( p100(Y)
& ~ p101(Y) )
| ( ~ ! [X] :
( ~ ( p101(X)
& ~ p102(X)
& p2(X) )
| ~ r1(Y,X) )
& ~ ! [X] :
( ~ ( p101(X)
& ~ p102(X)
& ~ p2(X) )
| ~ r1(Y,X) ) ) ) )
| ~ r1(X,Y) ) )
| ~ ! [Y] :
( p2(Y)
| ~ r1(X,Y) ) ),
inference(negate,[status(cth)],[main]) ).
fof(f_2_2,negated_conjecture,
? [X] :
( p100(X)
& ~ p101(X)
& ! [Y] :
( ( ( ~ p101(Y)
| p100(Y) )
& ( ~ p102(Y)
| p101(Y) )
& ( ~ p100(Y)
| ( ( ~ p1(Y)
| ! [X] :
( ~ p100(X)
| p1(X)
| ~ r1(Y,X) ) )
& ( p1(Y)
| ! [X] :
( ~ p100(X)
| ~ p1(X)
| ~ r1(Y,X) ) ) ) )
& ( ~ p101(Y)
| ( ( ~ p2(Y)
| ! [X] :
( ~ p101(X)
| p2(X)
| ~ r1(Y,X) ) )
& ( p2(Y)
| ! [X] :
( ~ p101(X)
| ~ p2(X)
| ~ r1(Y,X) ) ) ) )
& ( ~ p100(Y)
| p101(Y)
| ( ? [X] :
( p101(X)
& ~ p102(X)
& p2(X)
& r1(Y,X) )
& ? [X] :
( p101(X)
& ~ p102(X)
& ~ p2(X)
& r1(Y,X) ) ) ) )
| ~ r1(X,Y) )
& ! [Y] :
( p2(Y)
| ~ r1(X,Y) ) ),
inference(fof_nnf,[status(thm)],[f_2_1]) ).
fof(f_2_3,negated_conjecture,
? [U_9] :
( p100(U_9)
& ~ p101(U_9)
& ! [U_8] :
( ( ( ~ p101(U_8)
| p100(U_8) )
& ( ~ p102(U_8)
| p101(U_8) )
& ( ~ p100(U_8)
| ( ( ~ p1(U_8)
| ! [U_7] :
( ~ p100(U_7)
| p1(U_7)
| ~ r1(U_8,U_7) ) )
& ( p1(U_8)
| ! [U_6] :
( ~ p100(U_6)
| ~ p1(U_6)
| ~ r1(U_8,U_6) ) ) ) )
& ( ~ p101(U_8)
| ( ( ~ p2(U_8)
| ! [U_5] :
( ~ p101(U_5)
| p2(U_5)
| ~ r1(U_8,U_5) ) )
& ( p2(U_8)
| ! [U_4] :
( ~ p101(U_4)
| ~ p2(U_4)
| ~ r1(U_8,U_4) ) ) ) )
& ( ~ p100(U_8)
| p101(U_8)
| ( ? [U_3] :
( p101(U_3)
& ~ p102(U_3)
& p2(U_3)
& r1(U_8,U_3) )
& ? [U_2] :
( p101(U_2)
& ~ p102(U_2)
& ~ p2(U_2)
& r1(U_8,U_2) ) ) ) )
| ~ r1(U_9,U_8) )
& ! [U_1] :
( p2(U_1)
| ~ r1(U_9,U_1) ) ),
inference(variable_rename,[status(thm)],[f_2_2]) ).
fof(f_2_4,negated_conjecture,
( p100(sK1)
& ~ p101(sK1)
& ! [U_8] :
( ( ( ~ p101(U_8)
| p100(U_8) )
& ( ~ p102(U_8)
| p101(U_8) )
& ( ~ p100(U_8)
| ( ( ~ p1(U_8)
| ! [U_7] :
( ~ p100(U_7)
| p1(U_7)
| ~ r1(U_8,U_7) ) )
& ( p1(U_8)
| ! [U_6] :
( ~ p100(U_6)
| ~ p1(U_6)
| ~ r1(U_8,U_6) ) ) ) )
& ( ~ p101(U_8)
| ( ( ~ p2(U_8)
| ! [U_5] :
( ~ p101(U_5)
| p2(U_5)
| ~ r1(U_8,U_5) ) )
& ( p2(U_8)
| ! [U_4] :
( ~ p101(U_4)
| ~ p2(U_4)
| ~ r1(U_8,U_4) ) ) ) )
& ( ~ p100(U_8)
| p101(U_8)
| ( ? [U_3] :
( p101(U_3)
& ~ p102(U_3)
& p2(U_3)
& r1(U_8,U_3) )
& ? [U_2] :
( p101(U_2)
& ~ p102(U_2)
& ~ p2(U_2)
& r1(U_8,U_2) ) ) ) )
| ~ r1(sK1,U_8) )
& ! [U_1] :
( p2(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_9,sK1)],[f_2_3]) ).
fof(f_2_5,negated_conjecture,
( p100(sK1)
& ~ p101(sK1)
& ! [U_8] :
( ( ( ~ p101(U_8)
| p100(U_8) )
& ( ~ p102(U_8)
| p101(U_8) )
& ( ~ p100(U_8)
| ( ( ~ p1(U_8)
| ! [U_7] :
( ~ p100(U_7)
| p1(U_7)
| ~ r1(U_8,U_7) ) )
& ( p1(U_8)
| ! [U_6] :
( ~ p100(U_6)
| ~ p1(U_6)
| ~ r1(U_8,U_6) ) ) ) )
& ( ~ p101(U_8)
| ( ( ~ p2(U_8)
| ! [U_5] :
( ~ p101(U_5)
| p2(U_5)
| ~ r1(U_8,U_5) ) )
& ( p2(U_8)
| ! [U_4] :
( ~ p101(U_4)
| ~ p2(U_4)
| ~ r1(U_8,U_4) ) ) ) )
& ( ~ p100(U_8)
| p101(U_8)
| ( ? [U_3] :
( p101(U_3)
& ~ p102(U_3)
& p2(U_3)
& r1(U_8,U_3) )
& p101(sK2(U_8))
& ~ p102(sK2(U_8))
& ~ p2(sK2(U_8))
& r1(U_8,sK2(U_8)) ) ) )
| ~ r1(sK1,U_8) )
& ! [U_1] :
( p2(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2(U_8))],[f_2_4]) ).
fof(f_2_6,negated_conjecture,
( p100(sK1)
& ~ p101(sK1)
& ! [U_8] :
( ( ( ~ p101(U_8)
| p100(U_8) )
& ( ~ p102(U_8)
| p101(U_8) )
& ( ~ p100(U_8)
| ( ( ~ p1(U_8)
| ! [U_7] :
( ~ p100(U_7)
| p1(U_7)
| ~ r1(U_8,U_7) ) )
& ( p1(U_8)
| ! [U_6] :
( ~ p100(U_6)
| ~ p1(U_6)
| ~ r1(U_8,U_6) ) ) ) )
& ( ~ p101(U_8)
| ( ( ~ p2(U_8)
| ! [U_5] :
( ~ p101(U_5)
| p2(U_5)
| ~ r1(U_8,U_5) ) )
& ( p2(U_8)
| ! [U_4] :
( ~ p101(U_4)
| ~ p2(U_4)
| ~ r1(U_8,U_4) ) ) ) )
& ( ~ p100(U_8)
| p101(U_8)
| ( p101(sK3(U_8))
& ~ p102(sK3(U_8))
& p2(sK3(U_8))
& r1(U_8,sK3(U_8))
& p101(sK2(U_8))
& ~ p102(sK2(U_8))
& ~ p2(sK2(U_8))
& r1(U_8,sK2(U_8)) ) ) )
| ~ r1(sK1,U_8) )
& ! [U_1] :
( p2(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_3,sK3(U_8))],[f_2_5]) ).
fof(f_2_7,negated_conjecture,
( ! [U_6,U_8,U_7] :
( ~ p1(U_8)
| ~ p100(U_7)
| p1(U_7)
| ~ r1(U_8,U_7)
| ~ sP2(U_6,U_8,U_7) )
& ! [U_6,U_8,U_7] :
( p1(U_8)
| ~ p100(U_6)
| ~ p1(U_6)
| ~ r1(U_8,U_6)
| ~ sP2(U_6,U_8,U_7) )
& ! [U_8,U_5,U_4] :
( ~ p2(U_8)
| ~ p101(U_5)
| p2(U_5)
| ~ r1(U_8,U_5)
| ~ sP1(U_8,U_5,U_4) )
& ! [U_8,U_5,U_4] :
( p2(U_8)
| ~ p101(U_4)
| ~ p2(U_4)
| ~ r1(U_8,U_4)
| ~ sP1(U_8,U_5,U_4) )
& ! [U_8] :
( p101(sK3(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( ~ p102(sK3(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( p2(sK3(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( r1(U_8,sK3(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( p101(sK2(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( ~ p102(sK2(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( ~ p2(sK2(U_8))
| ~ sP0(U_8) )
& ! [U_8] :
( r1(U_8,sK2(U_8))
| ~ sP0(U_8) )
& ! [U_6,U_8,U_5,U_4,U_7] :
( ~ p101(U_8)
| p100(U_8)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) )
& ! [U_6,U_8,U_5,U_4,U_7] :
( ~ p102(U_8)
| p101(U_8)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) )
& ! [U_6,U_8,U_5,U_4,U_7] :
( ~ p100(U_8)
| sP2(U_6,U_8,U_7)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) )
& ! [U_6,U_8,U_5,U_4,U_7] :
( ~ p101(U_8)
| sP1(U_8,U_5,U_4)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) )
& ! [U_6,U_8,U_5,U_4,U_7] :
( ~ p100(U_8)
| p101(U_8)
| sP0(U_8)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) )
& p100(sK1)
& ~ p101(sK1)
& ! [U_6,U_8,U_5,U_4,U_7] :
( sP3(U_6,U_8,U_5,U_4,U_7)
| ~ r1(sK1,U_8) )
& ! [U_1] :
( p2(U_1)
| ~ r1(sK1,U_1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3])],[f_2_6]) ).
cnf(f_2_8,negated_conjecture,
( p2(U_1)
| ~ r1(sK1,U_1) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_9,negated_conjecture,
( sP3(U_6,U_8,U_5,U_4,U_7)
| ~ r1(sK1,U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_10,negated_conjecture,
~ p101(sK1),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_11,negated_conjecture,
p100(sK1),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_12,negated_conjecture,
( ~ p100(U_8)
| p101(U_8)
| sP0(U_8)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_13,negated_conjecture,
( ~ p101(U_8)
| sP1(U_8,U_5,U_4)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_14,negated_conjecture,
( ~ p100(U_8)
| sP2(U_6,U_8,U_7)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_15,negated_conjecture,
( ~ p102(U_8)
| p101(U_8)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_16,negated_conjecture,
( ~ p101(U_8)
| p100(U_8)
| ~ sP3(U_6,U_8,U_5,U_4,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_17,negated_conjecture,
( r1(U_8,sK2(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_18,negated_conjecture,
( ~ p2(sK2(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_19,negated_conjecture,
( ~ p102(sK2(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_20,negated_conjecture,
( p101(sK2(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_21,negated_conjecture,
( r1(U_8,sK3(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_22,negated_conjecture,
( p2(sK3(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_23,negated_conjecture,
( ~ p102(sK3(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_24,negated_conjecture,
( p101(sK3(U_8))
| ~ sP0(U_8) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_25,negated_conjecture,
( p2(U_8)
| ~ p101(U_4)
| ~ p2(U_4)
| ~ r1(U_8,U_4)
| ~ sP1(U_8,U_5,U_4) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_26,negated_conjecture,
( ~ p2(U_8)
| ~ p101(U_5)
| p2(U_5)
| ~ r1(U_8,U_5)
| ~ sP1(U_8,U_5,U_4) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_27,negated_conjecture,
( p1(U_8)
| ~ p100(U_6)
| ~ p1(U_6)
| ~ r1(U_8,U_6)
| ~ sP2(U_6,U_8,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(f_2_28,negated_conjecture,
( ~ p1(U_8)
| ~ p100(U_7)
| p1(U_7)
| ~ r1(U_8,U_7)
| ~ sP2(U_6,U_8,U_7) ),
inference(clausify,[status(thm)],[f_2_7]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL656+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04 % 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/5.36 % Computer : n006.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Sat Sep 19 15:28:49 UTC 2026
% 0.08/5.37 % CPUTime :
% 0.13/5.61 % SZS status Theorem for theBenchmark
% 0.13/5.61 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------