%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU020+1 : TPTP v9.2.1. Released v3.2.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 : n009.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:10:30 PM UTC 2026
% Result : Theorem 1.31s 1.73s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 79 ( 13 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 87 ( 31 ~; 28 |; 18 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 1 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t47_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(relation_composition(X2,X1))
& subset(relation_rng(X2),relation_dom(X1)) )
=> one_to_one(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t47_funct_1) ).
fof(t27_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2] :
( ( relation(X2)
& function(X2) )
=> ( relation_dom(relation_composition(X2,X1)) = relation_dom(X2)
=> subset(relation_rng(X2),relation_dom(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_funct_1) ).
fof(t53_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ? [X2] :
( relation(X2)
& function(X2)
& relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
=> one_to_one(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t53_funct_1) ).
fof(t71_relat_1,axiom,
! [X1] :
( relation_dom(identity_relation(X1)) = X1
& relation_rng(identity_relation(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t71_relat_1) ).
fof(t52_funct_1,axiom,
! [X1] : one_to_one(identity_relation(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t52_funct_1) ).
fof(c_0_5,plain,
! [X102,X103] :
( ~ relation(X102)
| ~ function(X102)
| ~ relation(X103)
| ~ function(X103)
| ~ one_to_one(relation_composition(X103,X102))
| ~ subset(relation_rng(X103),relation_dom(X102))
| one_to_one(X103) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t47_funct_1])])]) ).
fof(c_0_6,plain,
! [X96,X97] :
( ~ relation(X96)
| ~ function(X96)
| ~ relation(X97)
| ~ function(X97)
| relation_dom(relation_composition(X97,X96)) != relation_dom(X97)
| subset(relation_rng(X97),relation_dom(X96)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t27_funct_1])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ? [X2] :
( relation(X2)
& function(X2)
& relation_composition(X1,X2) = identity_relation(relation_dom(X1)) )
=> one_to_one(X1) ) ),
inference(assume_negation,[status(cth)],[t53_funct_1]) ).
cnf(c_0_8,plain,
( one_to_one(X2)
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| ~ one_to_one(relation_composition(X2,X1))
| ~ subset(relation_rng(X2),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( subset(relation_rng(X2),relation_dom(X1))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2)
| relation_dom(relation_composition(X2,X1)) != relation_dom(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( relation(esk10_0)
& function(esk10_0)
& relation(esk11_0)
& function(esk11_0)
& relation_composition(esk10_0,esk11_0) = identity_relation(relation_dom(esk10_0))
& ~ one_to_one(esk10_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X114] :
( relation_dom(identity_relation(X114)) = X114
& relation_rng(identity_relation(X114)) = X114 ),
inference(variable_rename,[status(thm)],[t71_relat_1]) ).
fof(c_0_12,plain,
! [X107] : one_to_one(identity_relation(X107)),
inference(variable_rename,[status(thm)],[t52_funct_1]) ).
cnf(c_0_13,plain,
( one_to_one(X1)
| relation_dom(relation_composition(X1,X2)) != relation_dom(X1)
| ~ one_to_one(relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X1)
| ~ function(X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
relation_composition(esk10_0,esk11_0) = identity_relation(relation_dom(esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
relation_dom(identity_relation(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
one_to_one(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
relation(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
function(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
function(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
~ one_to_one(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU020+1 : TPTP v9.2.1. Released v3.2.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.13/0.32 % Computer : n009.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 02:41:26 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.31/1.73 % Version : CSE_E---1.7
% 1.31/1.73 % Problem : theBenchmark.p
% 1.31/1.73 % SZS status Theorem for theBenchmark.p
% 1.31/1.73 % SZS output start CNFRefutation
% See solution above
% 1.31/1.73 % Total time : 1.372s
%------------------------------------------------------------------------------