%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : RNG101+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/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:55:10 AM UTC 2026
% Result : Theorem 120.45s 120.75s
% Output : Proof 120.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 55 ( 19 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 48 ( 11 ~; 5 |; 32 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 3 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1933,hypothesis,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [W0] :
( sdtasdt0(xc,W0) = xy
& aElement0(W0) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [W0] :
( sdtasdt0(xc,W0) = xx
& aElement0(W0) ) ),
file('theBenchmark.p',m__1933) ).
fof(m__,conjecture,
? [W0] :
( sdtasdt0(xc,W0) = xx
& aElement0(W0) ),
file('theBenchmark.p',m__) ).
fof(f_39_1,plain,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [W0] :
( sdtasdt0(xc,W0) = xy
& aElement0(W0) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [W0] :
( sdtasdt0(xc,W0) = xx
& aElement0(W0) ) ),
inference(fof_nnf,[status(thm)],[m__1933]) ).
fof(f_39_2,plain,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [U_125] :
( sdtasdt0(xc,U_125) = xy
& aElement0(U_125) )
& aElementOf0(xx,slsdtgt0(xc))
& ? [U_124] :
( sdtasdt0(xc,U_124) = xx
& aElement0(U_124) ) ),
inference(variable_rename,[status(thm)],[f_39_1]) ).
fof(f_39_3,plain,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& ? [U_125] :
( sdtasdt0(xc,U_125) = xy
& aElement0(U_125) )
& aElementOf0(xx,slsdtgt0(xc))
& sdtasdt0(xc,sK24) = xx
& aElement0(sK24) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK24]),skolemize(U_124,sK24)],[f_39_2]) ).
fof(f_39_4,plain,
( aElement0(xz)
& aElementOf0(xy,slsdtgt0(xc))
& sdtasdt0(xc,sK25) = xy
& aElement0(sK25)
& aElementOf0(xx,slsdtgt0(xc))
& sdtasdt0(xc,sK24) = xx
& aElement0(sK24) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25]),skolemize(U_125,sK25)],[f_39_3]) ).
cnf(f_39_5,plain,
aElement0(sK24),
inference(clausify,[status(thm)],[f_39_4]) ).
cnf(f_39_6,plain,
sdtasdt0(xc,sK24) = xx,
inference(clausify,[status(thm)],[f_39_4]) ).
fof(f_40_1,negated_conjecture,
~ ? [W0] :
( sdtasdt0(xc,W0) = xx
& aElement0(W0) ),
inference(negate,[status(cth)],[m__]) ).
fof(f_40_2,negated_conjecture,
! [W0] :
( sdtasdt0(xc,W0) != xx
| ~ aElement0(W0) ),
inference(fof_nnf,[status(thm)],[f_40_1]) ).
fof(f_40_3,negated_conjecture,
! [U_126] :
( sdtasdt0(xc,U_126) != xx
| ~ aElement0(U_126) ),
inference(variable_rename,[status(thm)],[f_40_2]) ).
fof(f_40_4,negated_conjecture,
! [U_126] :
( sdtasdt0(xc,U_126) != xx
| ~ aElement0(U_126) ),
inference(definitional_conversion,[status(esa)],[f_40_3]) ).
cnf(f_40_5,negated_conjecture,
( sdtasdt0(xc,U_126) != xx
| ~ aElement0(U_126) ),
inference(clausify,[status(thm)],[f_40_4]) ).
cnf(t1,plain,
( sdtasdt0(xc,sK24) != xx
| ~ aElement0(sK24) ),
inference(start,[status(thm),parent(0:0)],[f_40_5]) ).
cnf(t2,plain,
aElement0(sK24),
inference(extension,[status(thm),parent(t1:1)],[f_39_5]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
sdtasdt0(xc,sK24) = xx,
inference(extension,[status(thm),parent(t1:2)],[f_39_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : RNG101+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.01 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/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 : Sat Sep 19 20:53:22 UTC 2026
% 0.03/0.30 % CPUTime :
% 120.45/120.75 % SZS status Theorem for theBenchmark
% 120.45/120.75 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------