%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU264+1 : TPTP v9.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.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:53:26 PM UTC 2025
% Result : Theorem 3.68s 1.97s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 28 ( 11 ~; 9 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ relation_of2_as_subset > relation_of2 > subset > element > relation > cartesian_product2 > #nlpp > relation_rng > relation_dom > powerset > #skF_2 > #skF_7 > #skF_3 > #skF_5 > #skF_6 > #skF_4 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(relation_dom,type,
relation_dom: $i > $i ).
tff(relation_of2,type,
relation_of2: ( $i * $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(relation_rng,type,
relation_rng: $i > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(relation_of2_as_subset,type,
relation_of2_as_subset: ( $i * $i * $i ) > $o ).
tff(f_69,negated_conjecture,
~ ! [A,B,C,D] :
( relation_of2_as_subset(D,C,A)
=> ( subset(A,B)
=> relation_of2_as_subset(D,C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_relset_1) ).
tff(f_56,axiom,
! [A,B,C] :
( relation_of2_as_subset(C,A,B)
=> ( subset(relation_dom(C),A)
& subset(relation_rng(C),B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_relset_1) ).
tff(f_75,axiom,
! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
tff(f_62,axiom,
! [A,B,C,D] :
( relation_of2_as_subset(D,C,A)
=> ( subset(relation_rng(D),B)
=> relation_of2_as_subset(D,C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_relset_1) ).
tff(c_36,plain,
~ relation_of2_as_subset('#skF_7','#skF_6','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_40,plain,
relation_of2_as_subset('#skF_7','#skF_6','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_62,plain,
! [C_42,B_43,A_44] :
( subset(relation_rng(C_42),B_43)
| ~ relation_of2_as_subset(C_42,A_44,B_43) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_68,plain,
subset(relation_rng('#skF_7'),'#skF_4'),
inference(resolution,[status(thm)],[c_40,c_62]) ).
tff(c_38,plain,
subset('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_140,plain,
! [A_75,C_76,B_77] :
( subset(A_75,C_76)
| ~ subset(B_77,C_76)
| ~ subset(A_75,B_77) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_161,plain,
! [A_75] :
( subset(A_75,'#skF_5')
| ~ subset(A_75,'#skF_4') ),
inference(resolution,[status(thm)],[c_38,c_140]) ).
tff(c_321,plain,
! [D_100,C_101,B_102,A_103] :
( relation_of2_as_subset(D_100,C_101,B_102)
| ~ subset(relation_rng(D_100),B_102)
| ~ relation_of2_as_subset(D_100,C_101,A_103) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_480,plain,
! [D_118,C_119,A_120] :
( relation_of2_as_subset(D_118,C_119,'#skF_5')
| ~ relation_of2_as_subset(D_118,C_119,A_120)
| ~ subset(relation_rng(D_118),'#skF_4') ),
inference(resolution,[status(thm)],[c_161,c_321]) ).
tff(c_486,plain,
( relation_of2_as_subset('#skF_7','#skF_6','#skF_5')
| ~ subset(relation_rng('#skF_7'),'#skF_4') ),
inference(resolution,[status(thm)],[c_40,c_480]) ).
tff(c_491,plain,
relation_of2_as_subset('#skF_7','#skF_6','#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_486]) ).
tff(c_493,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_491]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU264+1 : TPTP v9.0.0. Released v3.3.0.
% 0.03/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Apr 8 22:35:04 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.68/1.97 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.68/1.97
% 3.68/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------