%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU303+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:11:24 PM UTC 2026
% Result : Theorem 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 39 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 14 ~; 11 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_finset_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( finite(relation_dom(X1))
=> finite(relation_rng(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finset_1) ).
fof(fc13_finset_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1)
& finite(X2) )
=> finite(relation_image(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc13_finset_1) ).
fof(t146_relat_1,axiom,
! [X1] :
( relation(X1)
=> relation_image(X1,relation_dom(X1)) = relation_rng(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t146_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( finite(relation_dom(X1))
=> finite(relation_rng(X1)) ) ),
inference(assume_negation,[status(cth)],[t26_finset_1]) ).
fof(c_0_4,plain,
! [X10,X11] :
( ~ relation(X10)
| ~ function(X10)
| ~ finite(X11)
| finite(relation_image(X10,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc13_finset_1])]) ).
fof(c_0_5,plain,
! [X13] :
( ~ relation(X13)
| relation_image(X13,relation_dom(X13)) = relation_rng(X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t146_relat_1])]) ).
fof(c_0_6,negated_conjecture,
( relation(esk2_0)
& function(esk2_0)
& finite(relation_dom(esk2_0))
& ~ finite(relation_rng(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_7,plain,
( finite(relation_image(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( relation_image(X1,relation_dom(X1)) = relation_rng(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
~ finite(relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( finite(relation_rng(X1))
| ~ finite(relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
finite(relation_dom(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU303+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n028.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 02:56:31 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Theorem for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------