%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU303+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:44 AM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 41 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 36 ( 13 ~; 7 |; 9 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 5 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t146_relat_1,axiom,
! [A] :
( relation(A)
=> relation_image(A,relation_dom(A)) = relation_rng(A) ),
file('theBenchmark.p',t146_relat_1) ).
fof(t17_finset_1,axiom,
! [A,B] :
( ( function(B)
& relation(B) )
=> ( finite(A)
=> finite(relation_image(B,A)) ) ),
file('theBenchmark.p',t17_finset_1) ).
fof(t26_finset_1,conjecture,
! [A] :
( ( function(A)
& relation(A) )
=> ( finite(relation_dom(A))
=> finite(relation_rng(A)) ) ),
file('theBenchmark.p',t26_finset_1) ).
fof(t26_finset_1_neg,negated_conjecture,
~ ! [A] :
( ( function(A)
& relation(A) )
=> ( finite(relation_dom(A))
=> finite(relation_rng(A)) ) ),
inference(assume_negation,[status(cth)],[t26_finset_1]) ).
cnf(c_11,plain,
( relation_rng(A) = relation_image(A,relation_dom(A))
| ~ relation(A) ),
inference(clausify,[status(thm)],[t146_relat_1]) ).
cnf(c_12,plain,
( finite(relation_image(A,B))
| ~ finite(B)
| ~ function(A)
| ~ relation(A) ),
inference(clausify,[status(thm)],[t17_finset_1]) ).
fof(nnf_8,plain,
? [A] :
( ~ finite(relation_rng(A))
& finite(relation_dom(A))
& function(A)
& relation(A) ),
inference(fof_nnf,[status(thm)],[t26_finset_1_neg]) ).
fof(sk_t26_finset_1_neg,plain,
( ~ finite(relation_rng(sK0))
& finite(relation_dom(sK0))
& function(sK0)
& relation(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(A,sK0)],[nnf_8]) ).
cnf(c_13,negated_conjecture,
relation(sK0),
inference(split_conjunct,[status(thm)],[sk_t26_finset_1_neg]) ).
cnf(c_14,negated_conjecture,
relation_rng(sK0) = relation_image(sK0,relation_dom(sK0)),
inference(resolve,[status(thm)],[c_13,c_11]) ).
cnf(c_15,negated_conjecture,
( finite(relation_image(sK0,A))
| ~ finite(A)
| ~ function(sK0) ),
inference(resolve,[status(thm)],[c_13,c_12]) ).
cnf(c_18,negated_conjecture,
~ finite(relation_rng(sK0)),
inference(split_conjunct,[status(thm)],[sk_t26_finset_1_neg]) ).
cnf(c_19,negated_conjecture,
~ finite(relation_image(sK0,relation_dom(sK0))),
inference(paramod,[status(thm)],[c_14,c_18]) ).
cnf(c_20,negated_conjecture,
finite(relation_dom(sK0)),
inference(split_conjunct,[status(thm)],[sk_t26_finset_1_neg]) ).
cnf(c_21,negated_conjecture,
function(sK0),
inference(split_conjunct,[status(thm)],[sk_t26_finset_1_neg]) ).
cnf(c_25,negated_conjecture,
( finite(relation_image(sK0,relation_dom(sK0)))
| ~ function(sK0) ),
inference(resolve,[status(thm)],[c_15,c_20]) ).
cnf(c_23,negated_conjecture,
~ function(sK0),
inference(resolve,[status(thm)],[c_25,c_19]) ).
cnf(c_24,plain,
$false,
inference(resolve,[status(thm)],[c_23,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU303+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n017.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 09:04:03 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 334059 was started by sandbox on n017,
% 0.09/0.37 % Sat Sep 26 09:04:03 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.38
% 0.13/0.38 % From the command line: assign(max_seconds, 300).
% 0.13/0.39
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39
% 0.13/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.39 % Length of proof is 14.
% 0.13/0.39 % Level of proof is 5.
% 0.13/0.39 % Maximum clause weight is 8.000.
% 0.13/0.39 % Given clauses 6.
% 0.13/0.39
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------