%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ITP001_2 : TPTP v9.0.0. Bugfixed v7.5.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 : n004.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 06:51:49 PM UTC 2025
% Result : Theorem 3.07s 1.79s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 1
% Syntax : Number of formulae : 2 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 2 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-4 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mem > p > k > arr > ap > #nlpp > surj__o > inj__o > i > c_2Emin_2E_3D > ind > fo__c_2Ebool_2ET > c_2Ebool_2ET > bool > #skF_1
%Foreground sorts:
tff(tp__o,type,
tp__o: $tType ).
tff(del,type,
del: $tType ).
%Background operators:
%Foreground operators:
tff(fo__c_2Ebool_2ET,type,
fo__c_2Ebool_2ET: tp__o ).
tff(surj__o,type,
surj__o: $i > tp__o ).
tff(i,type,
i: del > $i ).
tff(ap,type,
ap: ( $i * $i ) > $i ).
tff(p,type,
p: $i > $o ).
tff(k,type,
k: ( del * $i ) > $i ).
tff(arr,type,
arr: ( del * del ) > del ).
tff(c_2Ebool_2ET,type,
c_2Ebool_2ET: $i ).
tff(c_2Emin_2E_3D,type,
c_2Emin_2E_3D: del > $i ).
tff(ind,type,
ind: del ).
tff(mem,type,
mem: ( $i * del ) > $o ).
tff(bool,type,
bool: del ).
tff('#skF_1',type,
'#skF_1': ( del * del * $i * $i ) > $i ).
tff(inj__o,type,
inj__o: tp__o > $i ).
tff(f_122,negated_conjecture,
~ $true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Ebool_2ETRUTH) ).
tff(c_41,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : ITP001_2 : TPTP v9.0.0. Bugfixed v7.5.0.
% 0.06/0.14 % 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.12/0.35 % Computer : n004.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Apr 8 00:19:53 EDT 2025
% 0.12/0.35 % CPUTime :
% 3.07/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.79
% 3.17/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------