%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU255+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/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 : n002.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:24 PM UTC 2025
% Result : Theorem 17.20s 6.27s
% Output : CNFRefutation 17.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 11 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 33 ~; 36 |; 2 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 8 con; 0-2 aty)
% Number of variables : 33 ( 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation > one_to_one > function > empty > antisymmetric > unordered_pair > set_intersection2 > relation_restriction > ordered_pair > cartesian_product2 > #nlpp > singleton > empty_set > #skF_2 > #skF_1 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_9 > #skF_8 > #skF_4 > #skF_3
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(antisymmetric,type,
antisymmetric: $i > $o ).
tff(relation,type,
relation: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(relation_restriction,type,
relation_restriction: ( $i * $i ) > $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(f_123,negated_conjecture,
~ ! [A,B] :
( relation(B)
=> ( antisymmetric(B)
=> antisymmetric(relation_restriction(B,A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_wellord1) ).
tff(f_63,axiom,
! [A,B] :
( relation(A)
=> relation(relation_restriction(A,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_wellord1) ).
tff(f_83,axiom,
! [A] :
( relation(A)
=> ( antisymmetric(A)
<=> ! [B,C] :
( ( in(ordered_pair(B,C),A)
& in(ordered_pair(C,B),A) )
=> ( B = C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_wellord1) ).
tff(f_112,axiom,
! [A,B,C] :
( relation(C)
=> ( in(A,relation_restriction(C,B))
<=> ( in(A,C)
& in(A,cartesian_product2(B,B)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_wellord1) ).
tff(c_84,plain,
relation('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_26,plain,
! [A_14,B_15] :
( relation(relation_restriction(A_14,B_15))
| ~ relation(A_14) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_306,plain,
! [A_66] :
( ( '#skF_2'(A_66) != '#skF_3'(A_66) )
| antisymmetric(A_66)
| ~ relation(A_66) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_1233,plain,
! [A_129,B_130] :
( ( '#skF_2'(relation_restriction(A_129,B_130)) != '#skF_3'(relation_restriction(A_129,B_130)) )
| antisymmetric(relation_restriction(A_129,B_130))
| ~ relation(A_129) ),
inference(resolution,[status(thm)],[c_26,c_306]) ).
tff(c_80,plain,
~ antisymmetric(relation_restriction('#skF_10','#skF_9')),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_1236,plain,
( ( '#skF_2'(relation_restriction('#skF_10','#skF_9')) != '#skF_3'(relation_restriction('#skF_10','#skF_9')) )
| ~ relation('#skF_10') ),
inference(resolution,[status(thm)],[c_1233,c_80]) ).
tff(c_1242,plain,
'#skF_2'(relation_restriction('#skF_10','#skF_9')) != '#skF_3'(relation_restriction('#skF_10','#skF_9')),
inference(demodulation,[status(thm),theory(equality)],[c_84,c_1236]) ).
tff(c_82,plain,
antisymmetric('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_618,plain,
! [A_86] :
( in(ordered_pair('#skF_3'(A_86),'#skF_2'(A_86)),A_86)
| antisymmetric(A_86)
| ~ relation(A_86) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_76,plain,
! [A_29,C_31,B_30] :
( in(A_29,C_31)
| ~ in(A_29,relation_restriction(C_31,B_30))
| ~ relation(C_31) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_634,plain,
! [C_31,B_30] :
( in(ordered_pair('#skF_3'(relation_restriction(C_31,B_30)),'#skF_2'(relation_restriction(C_31,B_30))),C_31)
| ~ relation(C_31)
| antisymmetric(relation_restriction(C_31,B_30))
| ~ relation(relation_restriction(C_31,B_30)) ),
inference(resolution,[status(thm)],[c_618,c_76]) ).
tff(c_666,plain,
! [A_88] :
( in(ordered_pair('#skF_2'(A_88),'#skF_3'(A_88)),A_88)
| antisymmetric(A_88)
| ~ relation(A_88) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_2990,plain,
! [C_203,B_204] :
( in(ordered_pair('#skF_2'(relation_restriction(C_203,B_204)),'#skF_3'(relation_restriction(C_203,B_204))),C_203)
| ~ relation(C_203)
| antisymmetric(relation_restriction(C_203,B_204))
| ~ relation(relation_restriction(C_203,B_204)) ),
inference(resolution,[status(thm)],[c_666,c_76]) ).
tff(c_44,plain,
! [C_28,B_27,A_22] :
( ( C_28 = B_27 )
| ~ in(ordered_pair(C_28,B_27),A_22)
| ~ in(ordered_pair(B_27,C_28),A_22)
| ~ antisymmetric(A_22)
| ~ relation(A_22) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_19697,plain,
! [C_398,B_399] :
( ( '#skF_2'(relation_restriction(C_398,B_399)) = '#skF_3'(relation_restriction(C_398,B_399)) )
| ~ in(ordered_pair('#skF_3'(relation_restriction(C_398,B_399)),'#skF_2'(relation_restriction(C_398,B_399))),C_398)
| ~ antisymmetric(C_398)
| ~ relation(C_398)
| antisymmetric(relation_restriction(C_398,B_399))
| ~ relation(relation_restriction(C_398,B_399)) ),
inference(resolution,[status(thm)],[c_2990,c_44]) ).
tff(c_19748,plain,
! [C_400,B_401] :
( ( '#skF_2'(relation_restriction(C_400,B_401)) = '#skF_3'(relation_restriction(C_400,B_401)) )
| ~ antisymmetric(C_400)
| ~ relation(C_400)
| antisymmetric(relation_restriction(C_400,B_401))
| ~ relation(relation_restriction(C_400,B_401)) ),
inference(resolution,[status(thm)],[c_634,c_19697]) ).
tff(c_19779,plain,
! [A_402,B_403] :
( ( '#skF_2'(relation_restriction(A_402,B_403)) = '#skF_3'(relation_restriction(A_402,B_403)) )
| ~ antisymmetric(A_402)
| antisymmetric(relation_restriction(A_402,B_403))
| ~ relation(A_402) ),
inference(resolution,[status(thm)],[c_26,c_19748]) ).
tff(c_19782,plain,
( ( '#skF_2'(relation_restriction('#skF_10','#skF_9')) = '#skF_3'(relation_restriction('#skF_10','#skF_9')) )
| ~ antisymmetric('#skF_10')
| ~ relation('#skF_10') ),
inference(resolution,[status(thm)],[c_19779,c_80]) ).
tff(c_19800,plain,
'#skF_2'(relation_restriction('#skF_10','#skF_9')) = '#skF_3'(relation_restriction('#skF_10','#skF_9')),
inference(demodulation,[status(thm),theory(equality)],[c_84,c_82,c_19782]) ).
tff(c_19802,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1242,c_19800]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU255+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/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 : n002.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 22:33:02 EDT 2025
% 0.13/0.34 % CPUTime :
% 17.20/6.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.20/6.28
% 17.20/6.28 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------