%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : REL049+1 : TPTP v9.0.0. Released v4.0.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 : n025.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:29:19 PM UTC 2025
% Result : Theorem 2.63s 1.65s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > join > composition > #nlpp > converse > complement > zero > top > one > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(top,type,
top: $i ).
tff(converse,type,
converse: $i > $i ).
tff(join,type,
join: ( $i * $i ) > $i ).
tff(composition,type,
composition: ( $i * $i ) > $i ).
tff(complement,type,
complement: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(meet,type,
meet: ( $i * $i ) > $i ).
tff(zero,type,
zero: $i ).
tff(f_90,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ( join(X0,X1) = X1 )
& ( join(X2,X1) = X1 ) )
=> ( join(join(X0,X2),X1) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(f_56,axiom,
! [X0,X1,X2] : ( join(X0,join(X1,X2)) = join(join(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
tff(c_32,plain,
join('#skF_1','#skF_2') = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_30,plain,
join('#skF_3','#skF_2') = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_4,plain,
! [X0_3,X1_4,X2_5] : ( join(join(X0_3,X1_4),X2_5) = join(X0_3,join(X1_4,X2_5)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_28,plain,
join(join('#skF_1','#skF_3'),'#skF_2') != '#skF_2',
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_34,plain,
join('#skF_1',join('#skF_3','#skF_2')) != '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_4,c_28]) ).
tff(c_36,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_30,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : REL049+1 : TPTP v9.0.0. Released v4.0.0.
% 0.06/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.33 % Computer : n025.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 18:12:50 EDT 2025
% 0.13/0.33 % CPUTime :
% 2.63/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.63/1.66
% 2.63/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------