%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : COL010-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/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 : n016.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:47:46 PM UTC 2025
% Result : Unsatisfiable 3.21s 1.99s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > s2 > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(s2,type,
s2: $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(f_30,axiom,
! [X,Y,Z] : ( apply(apply(apply(s2,X),Y),Z) = apply(apply(X,Z),apply(Y,Y)) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_17,plain,
! [X_12,Y_13,Z_14] : ( apply(apply(apply(s2,X_12),Y_13),Z_14) = apply(apply(X_12,Z_14),apply(Y_13,Y_13)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( apply(apply(apply(b,X_1),Y_2),Z_3) = apply(X_1,apply(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_311,plain,
! [X_20,Y_21,Z_22] : ( apply(apply(apply(s2,apply(b,X_20)),Y_21),Z_22) = apply(X_20,apply(Z_22,apply(Y_21,Y_21))) ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_2]) ).
tff(c_6,plain,
! [Y_7] : ( apply(combinator,Y_7) != Y_7 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_446,plain,
! [Y_21,Z_22] : ( apply(apply(apply(s2,apply(b,combinator)),Y_21),Z_22) != apply(Z_22,apply(Y_21,Y_21)) ),
inference(superposition,[status(thm),theory(equality)],[c_311,c_6]) ).
tff(c_569,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL010-1 : TPTP v9.0.0. Released v1.0.0.
% 0.11/0.13 % 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.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 15:53:53 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.21/1.99 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.21/2.00
% 3.21/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------