%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL363-1 : TPTP v9.3.1. Released v2.3.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 : n029.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:46 AM UTC 2026
% Result : Unsatisfiable 3.88s 2.48s
% Output : CNFRefutation 4.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 37 ( 20 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 43 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > y > x
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $i ).
tff(is_a_theorem,type,
is_a_theorem: $i > $o ).
tff(y,type,
y: $i ).
tff(not,type,
not: $i > $i ).
tff(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_36,axiom,
! [X] : is_a_theorem(implies(implies(not(X),X),X)),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file(unknown,unknown) ).
tff(f_40,axiom,
~ is_a_theorem(implies(x,implies(implies(not(y),y),y))),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_6] : is_a_theorem(implies(implies(not(X_6),X_6),X_6)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_8,plain,
! [X_7,Y_8] : is_a_theorem(implies(X_7,implies(not(X_7),Y_8))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_13,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_32]) ).
tff(c_21,plain,
! [X_7,Y_8] :
( is_a_theorem(implies(not(X_7),Y_8))
| ~ is_a_theorem(X_7) ),
inference(resolution,[status(thm)],[c_8,c_13]) ).
tff(c_35,plain,
! [X_18,Y_19,Z_20] : is_a_theorem(implies(implies(X_18,Y_19),implies(implies(Y_19,Z_20),implies(X_18,Z_20)))),
inference(cnfTransformation,[status(thm)],[f_34]) ).
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_32]) ).
tff(c_39,plain,
! [Y_19,Z_20,X_18] :
( is_a_theorem(implies(implies(Y_19,Z_20),implies(X_18,Z_20)))
| ~ is_a_theorem(implies(X_18,Y_19)) ),
inference(resolution,[status(thm)],[c_35,c_2]) ).
tff(c_40,plain,
! [Y_21,Z_22,X_23] :
( is_a_theorem(implies(implies(Y_21,Z_22),implies(X_23,Z_22)))
| ~ is_a_theorem(implies(X_23,Y_21)) ),
inference(resolution,[status(thm)],[c_35,c_2]) ).
tff(c_45,plain,
! [X_24,Z_25,Y_26] :
( is_a_theorem(implies(X_24,Z_25))
| ~ is_a_theorem(implies(Y_26,Z_25))
| ~ is_a_theorem(implies(X_24,Y_26)) ),
inference(resolution,[status(thm)],[c_40,c_2]) ).
tff(c_255,plain,
! [X_55,X_56,Z_57,Y_58] :
( is_a_theorem(implies(X_55,implies(X_56,Z_57)))
| ~ is_a_theorem(implies(X_55,implies(Y_58,Z_57)))
| ~ is_a_theorem(implies(X_56,Y_58)) ),
inference(resolution,[status(thm)],[c_39,c_45]) ).
tff(c_295,plain,
! [X_59,X_60,Y_61] :
( is_a_theorem(implies(X_59,implies(X_60,Y_61)))
| ~ is_a_theorem(implies(X_60,not(X_59))) ),
inference(resolution,[status(thm)],[c_8,c_255]) ).
tff(c_321,plain,
! [X_62,X_63,Y_64] :
( is_a_theorem(implies(X_62,implies(not(X_63),Y_64)))
| ~ is_a_theorem(X_63) ),
inference(resolution,[status(thm)],[c_21,c_295]) ).
tff(c_59,plain,
! [X_24,X_6] :
( is_a_theorem(implies(X_24,X_6))
| ~ is_a_theorem(implies(X_24,implies(not(X_6),X_6))) ),
inference(resolution,[status(thm)],[c_6,c_45]) ).
tff(c_349,plain,
! [X_65,Y_66] :
( is_a_theorem(implies(X_65,Y_66))
| ~ is_a_theorem(Y_66) ),
inference(resolution,[status(thm)],[c_321,c_59]) ).
tff(c_10,plain,
~ is_a_theorem(implies(x,implies(implies(not(y),y),y))),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_375,plain,
~ is_a_theorem(implies(implies(not(y),y),y)),
inference(resolution,[status(thm)],[c_349,c_10]) ).
tff(c_394,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_375]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL363-1 : TPTP v9.3.1. Released v2.3.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.10/0.37 % Computer : n029.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 5 01:12:55 UTC 2026
% 0.11/0.37 % CPUTime :
% 3.88/2.48 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/2.48
% 3.88/2.48 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------