%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET954+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/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 : n024.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:39:39 PM UTC 2025
% Result : Theorem 2.86s 1.86s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 5 |; 1 &)
% ( 1 <=>; 1 =>; 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > unordered_pair > ordered_pair > cartesian_product2 > #nlpp > singleton > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(ordered_pair,type,
ordered_pair: ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(cartesian_product2,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(f_54,negated_conjecture,
~ ! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
=> in(ordered_pair(B,A),cartesian_product2(D,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t107_zfmisc_1) ).
tff(f_44,axiom,
! [A,B,C,D] :
( in(ordered_pair(A,B),cartesian_product2(C,D))
<=> ( in(A,C)
& in(B,D) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l55_zfmisc_1) ).
tff(c_22,plain,
in(ordered_pair('#skF_3','#skF_4'),cartesian_product2('#skF_5','#skF_6')),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_94,plain,
! [B_21,D_22,A_23,C_24] :
( in(B_21,D_22)
| ~ in(ordered_pair(A_23,B_21),cartesian_product2(C_24,D_22)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_98,plain,
in('#skF_4','#skF_6'),
inference(resolution,[status(thm)],[c_22,c_94]) ).
tff(c_187,plain,
! [A_29,C_30,B_31,D_32] :
( in(A_29,C_30)
| ~ in(ordered_pair(A_29,B_31),cartesian_product2(C_30,D_32)) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_191,plain,
in('#skF_3','#skF_5'),
inference(resolution,[status(thm)],[c_22,c_187]) ).
tff(c_196,plain,
! [A_33,B_34,C_35,D_36] :
( in(ordered_pair(A_33,B_34),cartesian_product2(C_35,D_36))
| ~ in(B_34,D_36)
| ~ in(A_33,C_35) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_20,plain,
~ in(ordered_pair('#skF_4','#skF_3'),cartesian_product2('#skF_6','#skF_5')),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_205,plain,
( ~ in('#skF_3','#skF_5')
| ~ in('#skF_4','#skF_6') ),
inference(resolution,[status(thm)],[c_196,c_20]) ).
tff(c_213,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_191,c_205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SET954+1 : TPTP v9.0.0. Released v3.2.0.
% 0.04/0.09 % 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.08/0.28 % Computer : n024.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Tue Apr 8 21:52:51 EDT 2025
% 0.08/0.29 % CPUTime :
% 2.86/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.86
% 2.86/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------