%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : CAT016-4 : 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 : n014.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:30 PM UTC 2025
% Result : Unsatisfiable 2.88s 1.72s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > compose > #nlpp > domain > codomain > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equivalent,type,
equivalent: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(domain,type,
domain: $i > $i ).
tff(there_exists,type,
there_exists: $i > $o ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f_108,axiom,
there_exists(a),
file(unknown,unknown) ).
tff(f_103,axiom,
! [X] : ( compose(X,domain(X)) = X ),
file(unknown,unknown) ).
tff(f_86,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| there_exists(domain(X)) ),
file(unknown,unknown) ).
tff(f_110,axiom,
~ there_exists(domain(a)),
file(unknown,unknown) ).
tff(c_24,plain,
there_exists(a),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_59,plain,
! [X_29,Y_30] :
( there_exists(domain(X_29))
| ~ there_exists(compose(X_29,Y_30)) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_66,plain,
! [X_31] :
( there_exists(domain(X_31))
| ~ there_exists(X_31) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_59]) ).
tff(c_26,plain,
~ there_exists(domain(a)),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_72,plain,
~ there_exists(a),
inference(resolution,[status(thm)],[c_66,c_26]) ).
tff(c_77,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CAT016-4 : TPTP v9.0.0. Released v1.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.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 15:39:04 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.88/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.88/1.72
% 2.88/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------