%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : CAT019-1 : TPTP v9.0.0. Released v1.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 : n020.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 05:46:31 PM UTC 2025
% Result : Unsatisfiable 2.92s 1.63s
% Output : CNFRefutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 6 ( 5 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 1 ( 1 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > defined > identity_map > compose > #nlpp > domain > codomain > c2 > c1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(c1,type,
c1: $i ).
tff(domain,type,
domain: $i > $i ).
tff(defined,type,
defined: ( $i * $i ) > $o ).
tff(c2,type,
c2: $i ).
tff(identity_map,type,
identity_map: $i > $o ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_183,axiom,
c2 != c1,
file(unknown,unknown) ).
tff(f_181,axiom,
! [Z] :
( ( c2 = Z )
| ( c1 != Z ) ),
file(unknown,unknown) ).
tff(c_42,plain,
c2 != c1,
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_40,plain,
c2 = c1,
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_43,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT019-1 : TPTP v9.0.0. Released v1.0.0.
% 0.12/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 : n020.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 : Mon Apr 7 15:40:49 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.92/1.63 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.92/1.63
% 2.92/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------