%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL077-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 : n020.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:11 AM UTC 2026
% Result : Unsatisfiable 4.16s 2.60s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 23 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 5 ( 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 60 ( 60 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_39,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(Y,X))),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X,Y] : is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file(unknown,unknown) ).
tff(f_41,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_45,axiom,
~ is_a_theorem(implies(not(not(a)),a)),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4] : is_a_theorem(implies(X_3,implies(Y_4,X_3))),
inference(cnfTransformation,[status(thm)],[f_39]) ).
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_37]) ).
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_8,plain,
! [X_8,Y_9] : is_a_theorem(implies(implies(not(X_8),not(Y_9)),implies(Y_9,X_8))),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_49,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_41]) ).
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_37]) ).
tff(c_57,plain,
! [X_28,Y_29,Z_30] :
( is_a_theorem(implies(implies(X_28,Y_29),implies(X_28,Z_30)))
| ~ is_a_theorem(implies(X_28,implies(Y_29,Z_30))) ),
inference(resolution,[status(thm)],[c_49,c_2]) ).
tff(c_62,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_57,c_2]) ).
tff(c_261,plain,
! [X_57,Y_58] :
( is_a_theorem(implies(implies(not(X_57),not(Y_58)),X_57))
| ~ is_a_theorem(implies(implies(not(X_57),not(Y_58)),Y_58)) ),
inference(resolution,[status(thm)],[c_8,c_62]) ).
tff(c_277,plain,
! [X_57,X_3] :
( is_a_theorem(implies(implies(not(X_57),not(X_3)),X_57))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_16,c_261]) ).
tff(c_126,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_62]) ).
tff(c_148,plain,
! [X_40,Z_41,Y_42] :
( is_a_theorem(implies(X_40,Z_41))
| ~ is_a_theorem(implies(implies(Y_42,X_40),Z_41)) ),
inference(resolution,[status(thm)],[c_4,c_126]) ).
tff(c_182,plain,
! [Y_43,X_44] : is_a_theorem(implies(not(Y_43),implies(Y_43,X_44))),
inference(resolution,[status(thm)],[c_8,c_148]) ).
tff(c_87,plain,
! [Y_4,Z_32,Y_33] :
( is_a_theorem(implies(Y_4,Z_32))
| ~ is_a_theorem(implies(Y_4,Y_33))
| ~ is_a_theorem(implies(Y_33,Z_32)) ),
inference(resolution,[status(thm)],[c_16,c_62]) ).
tff(c_574,plain,
! [Y_96,Z_97,X_98] :
( is_a_theorem(implies(not(Y_96),Z_97))
| ~ is_a_theorem(implies(implies(Y_96,X_98),Z_97)) ),
inference(resolution,[status(thm)],[c_182,c_87]) ).
tff(c_625,plain,
! [X_57,X_3] :
( is_a_theorem(implies(not(not(X_57)),X_57))
| ~ is_a_theorem(X_3) ),
inference(resolution,[status(thm)],[c_277,c_574]) ).
tff(c_638,plain,
! [X_3] : ~ is_a_theorem(X_3),
inference(splitLeft,[status(thm)],[c_625]) ).
tff(c_194,plain,
! [X_45,Y_46,Y_47] : is_a_theorem(implies(X_45,implies(Y_46,implies(Y_47,X_45)))),
inference(resolution,[status(thm)],[c_4,c_148]) ).
tff(c_147,plain,
! [X_3,Z_38,Y_4] :
( is_a_theorem(implies(X_3,Z_38))
| ~ is_a_theorem(implies(implies(Y_4,X_3),Z_38)) ),
inference(resolution,[status(thm)],[c_4,c_126]) ).
tff(c_207,plain,
! [X_3,Y_46,Y_47,Y_4] : is_a_theorem(implies(X_3,implies(Y_46,implies(Y_47,implies(Y_4,X_3))))),
inference(resolution,[status(thm)],[c_194,c_147]) ).
tff(c_670,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_638,c_207]) ).
tff(c_671,plain,
! [X_57] : is_a_theorem(implies(not(not(X_57)),X_57)),
inference(splitRight,[status(thm)],[c_625]) ).
tff(c_10,plain,
~ is_a_theorem(implies(not(not(a)),a)),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_674,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_671,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL077-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.08/0.35 % Computer : n020.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 16:27:57 UTC 2026
% 0.08/0.36 % CPUTime :
% 4.16/2.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/2.61
% 4.16/2.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------