%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL189-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 : n012.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 2.28s 1.40s
% Output : CNFRefutation 2.28s
% 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 : 6 ( 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_54,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
file(unknown,unknown) ).
tff(f_56,axiom,
! [A,B] : axiom(or(not(A),or(B,A))),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_83,axiom,
! [X,Z,Y] :
( theorem(or(not(X),Z))
| ~ axiom(or(not(X),Y))
| ~ theorem(or(not(Y),Z)) ),
file(unknown,unknown) ).
tff(f_62,axiom,
! [A,B,C] : axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_60,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_87,axiom,
~ theorem(or(not(p),or(not(or(not(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_54]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(or(not(A_2),or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_12,plain,
! [X_12] :
( ~ axiom(X_12)
| theorem(X_12) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_123,plain,
! [Y_39,Z_40,X_41] :
( ~ theorem(or(not(Y_39),Z_40))
| ~ axiom(or(not(X_41),Y_39))
| theorem(or(not(X_41),Z_40)) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
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_123]) ).
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_140,plain,
! [A_42,B_43,C_44] : axiom(or(not(or(not(A_42),B_43)),or(not(or(C_44,A_42)),or(C_44,B_43)))),
inference(cnfTransformation,[status(thm)],[f_62]) ).
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_75]) ).
tff(c_291,plain,
! [A_62,B_63,C_64] :
( ~ theorem(or(not(A_62),B_63))
| theorem(or(not(or(C_64,A_62)),or(C_64,B_63))) ),
inference(resolution,[status(thm)],[c_140,c_14]) ).
tff(c_110,plain,
! [A_36,B_37,C_38] : axiom(or(not(or(A_36,or(B_37,C_38))),or(B_37,or(A_36,C_38)))),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_114,plain,
! [A_36,B_37,C_38] :
( ~ theorem(or(A_36,or(B_37,C_38)))
| theorem(or(B_37,or(A_36,C_38))) ),
inference(resolution,[status(thm)],[c_110,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_291,c_114]) ).
tff(c_18,plain,
~ theorem(or(not(p),or(not(or(not(p),q)),q))),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_550,plain,
~ theorem(or(not(q),q)),
inference(resolution,[status(thm)],[c_542,c_18]) ).
tff(c_558,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_462,c_550]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL189-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % 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.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.29 % CPULimit : 300
% 0.03/0.29 % WCLimit : 300
% 0.03/0.29 % DateTime : Fri Sep 4 22:09:12 UTC 2026
% 0.03/0.29 % CPUTime :
% 2.28/1.40 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.28/1.41
% 2.28/1.41 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------