%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU295+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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 : Sun Sep 27 08:45:43 AM UTC 2026
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 1 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 11 ( 2 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc11_finset_1,axiom,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('theBenchmark.p',fc11_finset_1) ).
fof(t15_finset_1,conjecture,
! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
file('theBenchmark.p',t15_finset_1) ).
fof(t15_finset_1_neg,negated_conjecture,
~ ! [A,B] :
( finite(A)
=> finite(set_intersection2(A,B)) ),
inference(assume_negation,[status(cth)],[t15_finset_1]) ).
cnf(c_121,plain,
( finite(set_intersection2(A,B))
| ~ finite(A) ),
inference(clausify,[status(thm)],[fc11_finset_1]) ).
fof(nnf_60,plain,
? [A,B] :
( ~ finite(set_intersection2(A,B))
& finite(A) ),
inference(fof_nnf,[status(thm)],[t15_finset_1_neg]) ).
fof(sk_t15_finset_1_neg,plain,
( ~ finite(set_intersection2(sK0,sK1))
& finite(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK0),skolemize(B,sK1)],[nnf_60]) ).
cnf(c_182,negated_conjecture,
finite(sK0),
inference(split_conjunct,[status(thm)],[sk_t15_finset_1_neg]) ).
cnf(c_183,negated_conjecture,
~ finite(set_intersection2(sK0,sK1)),
inference(split_conjunct,[status(thm)],[sk_t15_finset_1_neg]) ).
cnf(c_349,plain,
finite(set_intersection2(sK0,A)),
inference(resolve,[status(thm)],[c_182,c_121]) ).
cnf(c_350,plain,
$false,
inference(resolve,[status(thm)],[c_349,c_183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU295+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n009.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sat Sep 26 09:07:29 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44 % Process 3932911 was started by sandbox on n009,
% 0.18/0.44 % Sat Sep 26 09:07:29 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.46
% 0.18/0.46 % From the command line: assign(max_seconds, 300).
% 0.18/0.50
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50
% 0.18/0.50 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.18/0.50 % Length of proof is 7.
% 0.18/0.50 % Level of proof is 3.
% 0.18/0.50 % Maximum clause weight is 16.000.
% 0.18/0.50 % Given clauses 73.
% 0.18/0.50
% 0.18/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------