%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL188-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n013.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:26 AM UTC 2026
% Result : Unsatisfiable 4.14s 2.62s
% Output : CNFRefutation 4.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 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 : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 46 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(theorem,type,
theorem: $i > $o ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(q,type,
q: $i ).
tff(axiom,type,
axiom: $i > $o ).
tff(p,type,
p: $i ).
tff(f_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_55,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_66,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_86,axiom,
~ theorem(or(p,or(not(or(p,q)),q))),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_81,plain,
! [Y_35,Z_36,X_37] :
( ~ theorem(or(not(Y_35),Z_36))
| ~ axiom(or(not(X_37),Y_35))
| theorem(or(not(X_37),Z_36)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_406,plain,
! [X_84,Y_85,Z_86] :
( ~ axiom(or(not(X_84),Y_85))
| theorem(or(not(X_84),Z_86))
| ~ axiom(or(not(Y_85),Z_86)) ),
inference(resolution,[status(thm)],[c_12,c_81]) ).
tff(c_442,plain,
! [A_89,Z_90,B_91] :
( theorem(or(not(A_89),Z_90))
| ~ axiom(or(not(or(B_91,A_89)),Z_90)) ),
inference(resolution,[status(thm)],[c_4,c_406]) ).
tff(c_462,plain,
! [A_1] : theorem(or(not(A_1),A_1)),
inference(resolution,[status(thm)],[c_2,c_442]) ).
tff(c_115,plain,
! [A_40,B_41,C_42] : axiom(or(not(or(not(A_40),B_41)),or(not(or(C_42,A_40)),or(C_42,B_41)))),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_14,plain,
! [Y_14,X_13] :
( ~ theorem(Y_14)
| ~ axiom(or(not(Y_14),X_13))
| theorem(X_13) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_251,plain,
! [A_60,B_61,C_62] :
( ~ theorem(or(not(A_60),B_61))
| theorem(or(not(or(C_62,A_60)),or(C_62,B_61))) ),
inference(resolution,[status(thm)],[c_115,c_14]) ).
tff(c_56,plain,
! [A_30,B_31,C_32] : axiom(or(not(or(A_30,or(B_31,C_32))),or(B_31,or(A_30,C_32)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_60,plain,
! [A_30,B_31,C_32] :
( ~ theorem(or(A_30,or(B_31,C_32)))
| theorem(or(B_31,or(A_30,C_32))) ),
inference(resolution,[status(thm)],[c_56,c_14]) ).
tff(c_542,plain,
! [C_105,A_106,B_107] :
( theorem(or(C_105,or(not(or(C_105,A_106)),B_107)))
| ~ theorem(or(not(A_106),B_107)) ),
inference(resolution,[status(thm)],[c_251,c_60]) ).
tff(c_18,plain,
~ theorem(or(p,or(not(or(p,q)),q))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_552,plain,
~ theorem(or(not(q),q)),
inference(resolution,[status(thm)],[c_542,c_18]) ).
tff(c_559,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_462,c_552]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL188-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.08/0.34 % Computer : n013.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 4 19:51:05 UTC 2026
% 0.08/0.34 % CPUTime :
% 4.14/2.62 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.14/2.63
% 4.14/2.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------