%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : CAT018-3 : 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/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 : n022.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 34.14s 17.61s
% Output : CNFRefutation 34.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 38 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 21 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 24 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equivalent > there_exists > f1 > compose > #nlpp > domain > codomain > c > b > 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(b,type,
b: $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(compose,type,
compose: ( $i * $i ) > $i ).
tff(f1,type,
f1: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_157,axiom,
there_exists(compose(a,b)),
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_101,axiom,
! [X,Y,Z] : ( compose(X,compose(Y,Z)) = compose(compose(X,Y),Z) ),
file(unknown,unknown) ).
tff(f_99,axiom,
! [X,Y] :
( ~ there_exists(domain(X))
| ( domain(X) != codomain(Y) )
| there_exists(compose(X,Y)) ),
file(unknown,unknown) ).
tff(f_160,axiom,
~ there_exists(compose(a,compose(b,c))),
file(unknown,unknown) ).
tff(f_158,axiom,
there_exists(compose(b,c)),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X] :
( ~ there_exists(domain(X))
| there_exists(X) ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Y] :
( ~ there_exists(compose(X,Y))
| ( domain(X) = codomain(Y) ) ),
file(unknown,unknown) ).
tff(c_36,plain,
there_exists(compose(a,b)),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_20,plain,
! [X_18] : ( compose(X_18,domain(X_18)) = X_18 ),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_79,plain,
! [X_45,Y_46] :
( there_exists(domain(X_45))
| ~ there_exists(compose(X_45,Y_46)) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_85,plain,
! [X_18] :
( there_exists(domain(X_18))
| ~ there_exists(X_18) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_79]) ).
tff(c_18,plain,
! [X_15,Y_16,Z_17] : ( compose(compose(X_15,Y_16),Z_17) = compose(X_15,compose(Y_16,Z_17)) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_453,plain,
! [X_63,Y_64] :
( there_exists(compose(X_63,Y_64))
| ( domain(X_63) != codomain(Y_64) )
| ~ there_exists(domain(X_63)) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_51840,plain,
! [X_10536,Y_10537,Z_10538] :
( there_exists(compose(X_10536,compose(Y_10537,Z_10538)))
| ( domain(compose(X_10536,Y_10537)) != codomain(Z_10538) )
| ~ there_exists(domain(compose(X_10536,Y_10537))) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_453]) ).
tff(c_40,plain,
~ there_exists(compose(a,compose(b,c))),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_52224,plain,
( ( domain(compose(a,b)) != codomain(c) )
| ~ there_exists(domain(compose(a,b))) ),
inference(resolution,[status(thm)],[c_51840,c_40]) ).
tff(c_222927,plain,
~ there_exists(domain(compose(a,b))),
inference(splitLeft,[status(thm)],[c_52224]) ).
tff(c_223276,plain,
~ there_exists(compose(a,b)),
inference(resolution,[status(thm)],[c_85,c_222927]) ).
tff(c_223370,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_223276]) ).
tff(c_223371,plain,
domain(compose(a,b)) != codomain(c),
inference(splitRight,[status(thm)],[c_52224]) ).
tff(c_38,plain,
there_exists(compose(b,c)),
inference(cnfTransformation,[status(thm)],[f_158]) ).
tff(c_93,plain,
there_exists(domain(b)),
inference(resolution,[status(thm)],[c_38,c_79]) ).
tff(c_8,plain,
! [X_7] :
( there_exists(X_7)
| ~ there_exists(domain(X_7)) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_116,plain,
there_exists(b),
inference(resolution,[status(thm)],[c_93,c_8]) ).
tff(c_122,plain,
! [X_49,Y_50] :
( ( domain(X_49) = codomain(Y_50) )
| ~ there_exists(compose(X_49,Y_50)) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_136,plain,
domain(b) = codomain(c),
inference(resolution,[status(thm)],[c_38,c_122]) ).
tff(c_160,plain,
compose(b,codomain(c)) = b,
inference(superposition,[status(thm),theory(equality)],[c_136,c_20]) ).
tff(c_14,plain,
! [X_11,Y_12] :
( ( domain(X_11) = codomain(Y_12) )
| ~ there_exists(compose(X_11,Y_12)) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_273,plain,
( ( codomain(codomain(c)) = domain(b) )
| ~ there_exists(b) ),
inference(superposition,[status(thm),theory(equality)],[c_160,c_14]) ).
tff(c_283,plain,
codomain(codomain(c)) = codomain(c),
inference(demodulation,[status(thm),theory(equality)],[c_116,c_136,c_273]) ).
tff(c_343,plain,
! [X_58,Y_59,Z_60] : ( compose(compose(X_58,Y_59),Z_60) = compose(X_58,compose(Y_59,Z_60)) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_48663,plain,
! [X_9897,Y_9898,Z_9899] :
( ( domain(compose(X_9897,Y_9898)) = codomain(Z_9899) )
| ~ there_exists(compose(X_9897,compose(Y_9898,Z_9899))) ),
inference(superposition,[status(thm),theory(equality)],[c_343,c_14]) ).
tff(c_225873,plain,
! [X_37574,X_37575] :
( ( domain(compose(X_37574,X_37575)) = codomain(domain(X_37575)) )
| ~ there_exists(compose(X_37574,X_37575)) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_48663]) ).
tff(c_226747,plain,
domain(compose(a,b)) = codomain(domain(b)),
inference(resolution,[status(thm)],[c_36,c_225873]) ).
tff(c_226843,plain,
domain(compose(a,b)) = codomain(c),
inference(demodulation,[status(thm),theory(equality)],[c_283,c_136,c_226747]) ).
tff(c_226845,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_223371,c_226843]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CAT018-3 : TPTP v9.0.0. Released v1.0.0.
% 0.10/0.12 % 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.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Apr 7 15:39:36 EDT 2025
% 0.12/0.33 % CPUTime :
% 34.14/17.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 34.49/17.62
% 34.49/17.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------