%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SEU295+1 : TPTP v9.3.1. Released v3.3.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 : n007.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:53 AM UTC 2026
% Result : Theorem 0.13s 0.41s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 19 ~; 10 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 1 sgn 18 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_finset_1,axiom,
! [A,B] :
( ( finite(B)
& subset(A,B) )
=> finite(A) ),
file('theBenchmark.p',t13_finset_1) ).
fof(t15_finset_1,conjecture,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('theBenchmark.p',t15_finset_1) ).
fof(t17_xboole_1,axiom,
! [A,B] : subset(set_intersection2(A,B),A),
file('theBenchmark.p',t17_xboole_1) ).
fof(f_46_1,plain,
! [A,B] :
( finite(A)
| ~ finite(B)
| ~ subset(A,B) ),
inference(fof_nnf,[status(thm)],[t13_finset_1]) ).
fof(f_46_2,plain,
! [U_52,U_51] :
( finite(U_52)
| ~ finite(U_51)
| ~ subset(U_52,U_51) ),
inference(variable_rename,[status(thm)],[f_46_1]) ).
fof(f_46_3,plain,
! [U_52] :
( ! [U_51] :
( ~ finite(U_51)
| ~ subset(U_52,U_51) )
| finite(U_52) ),
inference(miniscope,[status(thm)],[f_46_2]) ).
cnf(f_46_4,plain,
( ~ finite(U_51)
| ~ subset(U_52,U_51)
| finite(U_52) ),
inference(clausify,[status(thm)],[f_46_3]) ).
fof(f_47_1,negated_conjecture,
~ ! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
inference(negate,[status(cth)],[t15_finset_1]) ).
fof(f_47_2,negated_conjecture,
? [A,B] :
( ~ finite(set_intersection2(A,B))
& finite(A) ),
inference(fof_nnf,[status(thm)],[f_47_1]) ).
fof(f_47_3,negated_conjecture,
? [U_54,U_53] :
( ~ finite(set_intersection2(U_54,U_53))
& finite(U_54) ),
inference(variable_rename,[status(thm)],[f_47_2]) ).
fof(f_47_4,negated_conjecture,
? [U_54] :
( ? [U_53] : ~ finite(set_intersection2(U_54,U_53))
& finite(U_54) ),
inference(miniscope,[status(thm)],[f_47_3]) ).
fof(f_47_5,negated_conjecture,
( ? [U_53] : ~ finite(set_intersection2(sK20,U_53))
& finite(sK20) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20]),skolemize(U_54,sK20)],[f_47_4]) ).
fof(f_47_6,negated_conjecture,
( ~ finite(set_intersection2(sK20,sK21))
& finite(sK20) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21]),skolemize(U_53,sK21)],[f_47_5]) ).
fof(f_47_7,negated_conjecture,
( ~ finite(set_intersection2(sK20,sK21))
& finite(sK20) ),
inference(definitional_conversion,[status(esa)],[f_47_6]) ).
cnf(f_47_8,negated_conjecture,
finite(sK20),
inference(clausify,[status(thm)],[f_47_7]) ).
cnf(f_47_9,negated_conjecture,
~ finite(set_intersection2(sK20,sK21)),
inference(clausify,[status(thm)],[f_47_7]) ).
fof(f_48_1,plain,
! [A,B] : subset(set_intersection2(A,B),A),
inference(fof_nnf,[status(thm)],[t17_xboole_1]) ).
fof(f_48_2,plain,
! [U_56,U_55] : subset(set_intersection2(U_56,U_55),U_56),
inference(variable_rename,[status(thm)],[f_48_1]) ).
cnf(f_48_3,plain,
subset(set_intersection2(U_56,U_55),U_56),
inference(clausify,[status(thm)],[f_48_2]) ).
cnf(t1,plain,
~ finite(set_intersection2(sK20,sK21)),
inference(start,[status(thm),parent(0:0)],[f_47_9]) ).
cnf(t2,plain,
( ~ subset(set_intersection2(sK20,sK21),sK20)
| ~ finite(sK20)
| finite(set_intersection2(sK20,sK21)) ),
inference(extension,[status(thm),parent(t1:1)],[f_46_4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
finite(sK20),
inference(extension,[status(thm),parent(t2:2)],[f_47_8]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
subset(set_intersection2(sK20,sK21),sK20),
inference(extension,[status(thm),parent(t2:3)],[f_48_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU295+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 19 23:47:19 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.41 % SZS status Theorem for theBenchmark
% 0.13/0.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------