%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT115+1 : TPTP v9.3.0. Released v9.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 : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:03:09 AM UTC 2026
% Result : Theorem 2.24s 1.48s
% Output : CNFRefutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 5 ( 5 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rule > #nlpp > issue > pi2 > pi1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(issue,type,
issue: $i > $i ).
tff(rule,type,
rule: $i > $o ).
tff(pi2,type,
pi2: $i ).
tff(pi1,type,
pi1: $i ).
tff(f_37,axiom,
pi1 != pi2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pi1_neq_pi2) ).
tff(f_40,negated_conjecture,
~ ( ( issue(pi1) != issue(pi2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture) ).
tff(f_31,axiom,
! [A,B] :
( ( issue(A) = issue(B) )
=> ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',issue_injective) ).
tff(c_8,plain,
pi2 != pi1,
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_10,plain,
issue(pi2) = issue(pi1),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_19,plain,
! [B_3,A_4] :
( ( B_3 = A_4 )
| ( issue(B_3) != issue(A_4) ) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_22,plain,
! [A_4] :
( ( pi2 = A_4 )
| ( issue(pi1) != issue(A_4) ) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_19]) ).
tff(c_28,plain,
pi2 = pi1,
inference(reflexivity,[status(thm),theory(equality)],[c_22]) ).
tff(c_30,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_8,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % 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.09/0.35 % Computer : n004.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 7 14:08:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 2.24/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.24/1.49
% 2.24/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------