%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU040+1 : TPTP v9.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n016.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 : Wed Apr 9 08:52:40 PM UTC 2025
% Result : Theorem 5.03s 2.24s
% Output : CNFRefutation 5.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 3 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation_empty_yielding > relation > one_to_one > function > empty > relation_dom_restriction > #nlpp > relation_rng > relation_dom > powerset > empty_set > #skF_5 > #skF_11 > #skF_1 > #skF_7 > #skF_10 > #skF_13 > #skF_2 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_6 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(relation_dom_restriction,type,
relation_dom_restriction: ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_217,negated_conjecture,
~ ! [A,B] :
( ( relation(B)
& function(B) )
=> ( subset(relation_dom(relation_dom_restriction(B,A)),relation_dom(B))
& subset(relation_rng(relation_dom_restriction(B,A)),relation_rng(B)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t76_funct_1) ).
tff(f_225,axiom,
! [A,B] :
( relation(B)
=> subset(relation_rng(relation_dom_restriction(B,A)),relation_rng(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t99_relat_1) ).
tff(f_221,axiom,
! [A,B] :
( relation(B)
=> subset(relation_dom(relation_dom_restriction(B,A)),relation_dom(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t89_relat_1) ).
tff(c_116,plain,
relation('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_1083,plain,
! [B_170,A_171] :
( subset(relation_rng(relation_dom_restriction(B_170,A_171)),relation_rng(B_170))
| ~ relation(B_170) ),
inference(cnfTransformation,[status(thm)],[f_225]) ).
tff(c_621,plain,
! [B_113,A_114] :
( subset(relation_dom(relation_dom_restriction(B_113,A_114)),relation_dom(B_113))
| ~ relation(B_113) ),
inference(cnfTransformation,[status(thm)],[f_221]) ).
tff(c_112,plain,
( ~ subset(relation_rng(relation_dom_restriction('#skF_13','#skF_12')),relation_rng('#skF_13'))
| ~ subset(relation_dom(relation_dom_restriction('#skF_13','#skF_12')),relation_dom('#skF_13')) ),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_124,plain,
~ subset(relation_dom(relation_dom_restriction('#skF_13','#skF_12')),relation_dom('#skF_13')),
inference(splitLeft,[status(thm)],[c_112]) ).
tff(c_624,plain,
~ relation('#skF_13'),
inference(resolution,[status(thm)],[c_621,c_124]) ).
tff(c_637,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_116,c_624]) ).
tff(c_638,plain,
~ subset(relation_rng(relation_dom_restriction('#skF_13','#skF_12')),relation_rng('#skF_13')),
inference(splitRight,[status(thm)],[c_112]) ).
tff(c_1086,plain,
~ relation('#skF_13'),
inference(resolution,[status(thm)],[c_1083,c_638]) ).
tff(c_1099,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_116,c_1086]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU040+1 : TPTP v9.0.0. Released v3.2.0.
% 0.04/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 8 21:57:23 EDT 2025
% 0.13/0.34 % CPUTime :
% 5.03/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.03/2.24
% 5.03/2.24 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------