%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL064-1 : TPTP v9.3.1. 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 : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 11:11:10 AM UTC 2026
% Result : Unsatisfiable 31.68s 16.18s
% Output : CNFRefutation 31.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 45 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(b,type,
b: $i ).
tff(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_40,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_44,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_5,Y_6,Z_7] : is_a_theorem(implies(implies(X_5,implies(Y_6,Z_7)),implies(implies(X_5,Y_6),implies(X_5,Z_7)))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_12,plain,
! [Y_12,X_13] :
( is_a_theorem(Y_12)
| ~ is_a_theorem(X_13)
| ~ is_a_theorem(implies(X_13,Y_12)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_16,plain,
! [Y_4,X_3] :
( is_a_theorem(implies(Y_4,X_3))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_4,c_12]) ).
tff(c_50,plain,
! [X_22,Y_23,Z_24] : is_a_theorem(implies(implies(X_22,implies(Y_23,Z_24)),implies(implies(X_22,Y_23),implies(X_22,Z_24)))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( is_a_theorem(Y_2)
| ~ is_a_theorem(X_1)
| ~ is_a_theorem(implies(X_1,Y_2)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_72,plain,
! [X_26,Y_27,Z_28] :
( is_a_theorem(implies(implies(X_26,Y_27),implies(X_26,Z_28)))
| ~ is_a_theorem(implies(X_26,implies(Y_27,Z_28))) ),
inference(resolution,[status(thm)],[c_50,c_2]) ).
tff(c_78,plain,
! [X_31,Z_32,Y_33] :
( is_a_theorem(implies(X_31,Z_32))
| ~ is_a_theorem(implies(X_31,Y_33))
| ~ is_a_theorem(implies(X_31,implies(Y_33,Z_32))) ),
inference(resolution,[status(thm)],[c_72,c_2]) ).
tff(c_142,plain,
! [Y_37,Z_38,Y_39] :
( is_a_theorem(implies(Y_37,Z_38))
| ~ is_a_theorem(implies(Y_37,Y_39))
| ~ is_a_theorem(implies(Y_39,Z_38)) ),
inference(resolution,[status(thm)],[c_16,c_78]) ).
tff(c_226,plain,
! [X_48,Z_49,Y_50] :
( is_a_theorem(implies(X_48,Z_49))
| ~ is_a_theorem(implies(implies(Y_50,X_48),Z_49)) ),
inference(resolution,[status(thm)],[c_4,c_142]) ).
tff(c_260,plain,
! [Y_6,Z_7,X_5] : is_a_theorem(implies(implies(Y_6,Z_7),implies(implies(X_5,Y_6),implies(X_5,Z_7)))),
inference(resolution,[status(thm)],[c_6,c_226]) ).
tff(c_54,plain,
! [X_22,Y_23,Z_24] :
( is_a_theorem(implies(implies(X_22,Y_23),implies(X_22,Z_24)))
| ~ is_a_theorem(implies(X_22,implies(Y_23,Z_24))) ),
inference(resolution,[status(thm)],[c_50,c_2]) ).
tff(c_5080,plain,
! [Y_303,X_304,Z_305] :
( is_a_theorem(implies(Y_303,implies(X_304,Z_305)))
| ~ is_a_theorem(implies(X_304,implies(Y_303,Z_305))) ),
inference(resolution,[status(thm)],[c_54,c_226]) ).
tff(c_5241,plain,
! [X_5,Y_6,Z_7] : is_a_theorem(implies(implies(X_5,Y_6),implies(implies(Y_6,Z_7),implies(X_5,Z_7)))),
inference(resolution,[status(thm)],[c_260,c_5080]) ).
tff(c_10,plain,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_54041,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_5241,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL064-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % 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.07/0.34 % Computer : n009.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 09:31:21 UTC 2026
% 0.07/0.34 % CPUTime :
% 31.68/16.18 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.68/16.19
% 31.68/16.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------