%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL664+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 : n019.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:46 AM UTC 2026
% Result : Theorem 0.11s 0.38s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 170 ( 0 equ)
% Maximal formula atoms : 16 ( 9 avg)
% Number of connectives : 247 ( 95 ~; 64 |; 88 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 71 ( 0 sgn 48 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X] :
~ ( ! [Y] :
( p11(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p13(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p15(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p14(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p16(Y)
| ~ r1(X,Y) ) ),
file('theBenchmark.p',main) ).
fof(f_2_1,negated_conjecture,
? [X] :
~ ( ! [Y] :
( p11(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p13(Y)
| ~ r1(X,Y) )
| ! [Y] :
( p15(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p14(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
| ~ ! [Y] :
( p16(Y)
| ~ r1(X,Y) ) ),
inference(negate,[status(cth)],[main]) ).
fof(f_2_2,negated_conjecture,
? [X] :
( ? [Y] :
( ~ p11(Y)
& r1(X,Y) )
& ? [Y] :
( ~ p12(Y)
& r1(X,Y) )
& ? [Y] :
( ~ p13(Y)
& r1(X,Y) )
& ? [Y] :
( ~ p15(Y)
& r1(X,Y) )
& ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
& ! [Y] :
( p14(Y)
| ~ r1(X,Y) )
& ! [Y] :
( p12(Y)
| ~ r1(X,Y) )
& ! [Y] :
( p16(Y)
| ~ r1(X,Y) ) ),
inference(fof_nnf,[status(thm)],[f_2_1]) ).
fof(f_2_3,negated_conjecture,
? [U_9] :
( ? [U_8] :
( ~ p11(U_8)
& r1(U_9,U_8) )
& ? [U_7] :
( ~ p12(U_7)
& r1(U_9,U_7) )
& ? [U_6] :
( ~ p13(U_6)
& r1(U_9,U_6) )
& ? [U_5] :
( ~ p15(U_5)
& r1(U_9,U_5) )
& ! [U_4] :
( p12(U_4)
| ~ r1(U_9,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(U_9,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(U_9,U_2) )
& ! [U_1] :
( p16(U_1)
| ~ r1(U_9,U_1) ) ),
inference(variable_rename,[status(thm)],[f_2_2]) ).
fof(f_2_4,negated_conjecture,
( ? [U_8] :
( ~ p11(U_8)
& r1(sK1,U_8) )
& ? [U_7] :
( ~ p12(U_7)
& r1(sK1,U_7) )
& ? [U_6] :
( ~ p13(U_6)
& r1(sK1,U_6) )
& ? [U_5] :
( ~ p15(U_5)
& r1(sK1,U_5) )
& ! [U_4] :
( p12(U_4)
| ~ r1(sK1,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(sK1,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(sK1,U_2) )
& ! [U_1] :
( p16(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,
( ? [U_8] :
( ~ p11(U_8)
& r1(sK1,U_8) )
& ? [U_7] :
( ~ p12(U_7)
& r1(sK1,U_7) )
& ? [U_6] :
( ~ p13(U_6)
& r1(sK1,U_6) )
& ~ p15(sK2)
& r1(sK1,sK2)
& ! [U_4] :
( p12(U_4)
| ~ r1(sK1,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(sK1,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(sK1,U_2) )
& ! [U_1] :
( p16(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_5,sK2)],[f_2_4]) ).
fof(f_2_6,negated_conjecture,
( ? [U_8] :
( ~ p11(U_8)
& r1(sK1,U_8) )
& ? [U_7] :
( ~ p12(U_7)
& r1(sK1,U_7) )
& ~ p13(sK3)
& r1(sK1,sK3)
& ~ p15(sK2)
& r1(sK1,sK2)
& ! [U_4] :
( p12(U_4)
| ~ r1(sK1,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(sK1,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(sK1,U_2) )
& ! [U_1] :
( p16(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3)],[f_2_5]) ).
fof(f_2_7,negated_conjecture,
( ? [U_8] :
( ~ p11(U_8)
& r1(sK1,U_8) )
& ~ p12(sK4)
& r1(sK1,sK4)
& ~ p13(sK3)
& r1(sK1,sK3)
& ~ p15(sK2)
& r1(sK1,sK2)
& ! [U_4] :
( p12(U_4)
| ~ r1(sK1,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(sK1,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(sK1,U_2) )
& ! [U_1] :
( p16(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_7,sK4)],[f_2_6]) ).
fof(f_2_8,negated_conjecture,
( ~ p11(sK5)
& r1(sK1,sK5)
& ~ p12(sK4)
& r1(sK1,sK4)
& ~ p13(sK3)
& r1(sK1,sK3)
& ~ p15(sK2)
& r1(sK1,sK2)
& ! [U_4] :
( p12(U_4)
| ~ r1(sK1,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(sK1,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(sK1,U_2) )
& ! [U_1] :
( p16(U_1)
| ~ r1(sK1,U_1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_8,sK5)],[f_2_7]) ).
fof(f_2_9,negated_conjecture,
( ~ p11(sK5)
& r1(sK1,sK5)
& ~ p12(sK4)
& r1(sK1,sK4)
& ~ p13(sK3)
& r1(sK1,sK3)
& ~ p15(sK2)
& r1(sK1,sK2)
& ! [U_4] :
( p12(U_4)
| ~ r1(sK1,U_4) )
& ! [U_3] :
( p14(U_3)
| ~ r1(sK1,U_3) )
& ! [U_2] :
( p12(U_2)
| ~ r1(sK1,U_2) )
& ! [U_1] :
( p16(U_1)
| ~ r1(sK1,U_1) ) ),
inference(definitional_conversion,[status(esa)],[f_2_8]) ).
cnf(f_2_13,negated_conjecture,
( p12(U_4)
| ~ r1(sK1,U_4) ),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_18,negated_conjecture,
r1(sK1,sK4),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(f_2_19,negated_conjecture,
~ p12(sK4),
inference(clausify,[status(thm)],[f_2_9]) ).
cnf(t1,plain,
~ p12(sK4),
inference(start,[status(thm),parent(0:0)],[f_2_19]) ).
cnf(t2,plain,
( ~ r1(sK1,sK4)
| p12(sK4) ),
inference(extension,[status(thm),parent(t1:1)],[f_2_13]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
r1(sK1,sK4),
inference(extension,[status(thm),parent(t2:2)],[f_2_18]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL664+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.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.07/0.34 % Computer : n019.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 19 15:33:05 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.11/0.38 % SZS status Theorem for theBenchmark
% 0.11/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------