%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU083+1 : TPTP v9.3.1. Released v3.2.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 : n018.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:58:01 AM UTC 2026
% Result : Theorem 0.15s 5.64s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 40 ( 16 ~; 8 |; 13 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_finset_1,conjecture,
! [A,B] :
( ( finite(B)
& finite(A) )
=> finite(set_union2(A,B)) ),
file('theBenchmark.p',t14_finset_1) ).
fof(l3_finset_1,axiom,
! [A,B] :
( ( finite(B)
& finite(A) )
=> finite(set_union2(A,B)) ),
file('theBenchmark.p',l3_finset_1) ).
fof(f_61_1,negated_conjecture,
~ ! [A,B] :
( ( finite(B)
& finite(A) )
=> finite(set_union2(A,B)) ),
inference(negate,[status(cth)],[t14_finset_1]) ).
fof(f_61_2,negated_conjecture,
? [A,B] :
( ~ finite(set_union2(A,B))
& finite(B)
& finite(A) ),
inference(fof_nnf,[status(thm)],[f_61_1]) ).
fof(f_61_3,negated_conjecture,
? [U_84,U_83] :
( ~ finite(set_union2(U_84,U_83))
& finite(U_83)
& finite(U_84) ),
inference(variable_rename,[status(thm)],[f_61_2]) ).
fof(f_61_4,negated_conjecture,
? [U_83] :
( ~ finite(set_union2(sK27,U_83))
& finite(U_83)
& finite(sK27) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK27]),skolemize(U_84,sK27)],[f_61_3]) ).
fof(f_61_5,negated_conjecture,
( ~ finite(set_union2(sK27,sK28))
& finite(sK28)
& finite(sK27) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK28]),skolemize(U_83,sK28)],[f_61_4]) ).
fof(f_61_6,negated_conjecture,
( ~ finite(set_union2(sK27,sK28))
& finite(sK28)
& finite(sK27) ),
inference(definitional_conversion,[status(esa)],[f_61_5]) ).
cnf(f_61_7,negated_conjecture,
finite(sK27),
inference(clausify,[status(thm)],[f_61_6]) ).
cnf(f_61_8,negated_conjecture,
finite(sK28),
inference(clausify,[status(thm)],[f_61_6]) ).
cnf(f_61_9,negated_conjecture,
~ finite(set_union2(sK27,sK28)),
inference(clausify,[status(thm)],[f_61_6]) ).
fof(f_62_1,plain,
! [A,B] :
( finite(set_union2(A,B))
| ~ finite(B)
| ~ finite(A) ),
inference(fof_nnf,[status(thm)],[l3_finset_1]) ).
fof(f_62_2,plain,
! [U_86,U_85] :
( finite(set_union2(U_86,U_85))
| ~ finite(U_85)
| ~ finite(U_86) ),
inference(variable_rename,[status(thm)],[f_62_1]) ).
cnf(f_62_3,plain,
( finite(set_union2(U_86,U_85))
| ~ finite(U_85)
| ~ finite(U_86) ),
inference(clausify,[status(thm)],[f_62_2]) ).
cnf(t1,plain,
~ finite(set_union2(sK27,sK28)),
inference(start,[status(thm),parent(0:0)],[f_61_9]) ).
cnf(t2,plain,
( ~ finite(sK28)
| ~ finite(sK27)
| finite(set_union2(sK27,sK28)) ),
inference(extension,[status(thm),parent(t1:1)],[f_62_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
finite(sK27),
inference(extension,[status(thm),parent(t2:2)],[f_61_7]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
finite(sK28),
inference(extension,[status(thm),parent(t2:3)],[f_61_8]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU083+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ 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.11/5.39 % Computer : n018.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Sat Sep 19 23:20:33 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.15/5.64 % SZS status Theorem for theBenchmark
% 0.15/5.64 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------