%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL203-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 : n004.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:29 AM UTC 2026
% Result : Unsatisfiable 11.92s 4.94s
% Output : CNFRefutation 11.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 28 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 74 ( 74 !; 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_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_59,axiom,
! [A,B,C] : axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_74,axiom,
! [X,Y] :
( theorem(X)
| ~ axiom(or(not(Y),X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
file(unknown,unknown) ).
tff(f_53,axiom,
! [A] : axiom(or(not(or(A,A)),A)),
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_86,axiom,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
file(unknown,unknown) ).
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_97,plain,
! [A_34,B_35,C_36] : axiom(or(not(or(A_34,or(B_35,C_36))),or(B_35,or(A_34,C_36)))),
inference(cnfTransformation,[status(thm)],[f_59]) ).
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_140,plain,
! [A_42,B_43,C_44] :
( ~ theorem(or(A_42,or(B_43,C_44)))
| theorem(or(B_43,or(A_42,C_44))) ),
inference(resolution,[status(thm)],[c_97,c_14]) ).
tff(c_319,plain,
! [B_68,A_69,C_70] :
( theorem(or(B_68,or(A_69,C_70)))
| ~ axiom(or(A_69,or(B_68,C_70))) ),
inference(resolution,[status(thm)],[c_12,c_140]) ).
tff(c_36,plain,
! [A_25,B_26] : axiom(or(not(or(A_25,B_26)),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_40,plain,
! [A_25,B_26] :
( ~ theorem(or(A_25,B_26))
| theorem(or(B_26,A_25)) ),
inference(resolution,[status(thm)],[c_36,c_14]) ).
tff(c_406,plain,
! [A_84,C_85,B_86] :
( theorem(or(or(A_84,C_85),B_86))
| ~ axiom(or(A_84,or(B_86,C_85))) ),
inference(resolution,[status(thm)],[c_319,c_40]) ).
tff(c_22,plain,
! [Y_22,X_23] :
( ~ theorem(Y_22)
| ~ axiom(or(not(Y_22),X_23))
| theorem(X_23) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_30,plain,
! [A_2,B_3] :
( ~ theorem(A_2)
| theorem(or(B_3,A_2)) ),
inference(resolution,[status(thm)],[c_4,c_22]) ).
tff(c_195,plain,
! [B_54,B_55,C_56] :
( theorem(or(B_54,or(B_55,C_56)))
| ~ theorem(or(B_54,C_56)) ),
inference(resolution,[status(thm)],[c_30,c_140]) ).
tff(c_2,plain,
! [A_1] : axiom(or(not(or(A_1,A_1)),A_1)),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_29,plain,
! [A_1] :
( ~ theorem(or(A_1,A_1))
| theorem(A_1) ),
inference(resolution,[status(thm)],[c_2,c_22]) ).
tff(c_214,plain,
! [B_55,C_56] :
( theorem(or(B_55,C_56))
| ~ theorem(or(or(B_55,C_56),C_56)) ),
inference(resolution,[status(thm)],[c_195,c_29]) ).
tff(c_428,plain,
! [A_87,B_88] :
( theorem(or(A_87,B_88))
| ~ axiom(or(A_87,or(B_88,B_88))) ),
inference(resolution,[status(thm)],[c_406,c_214]) ).
tff(c_449,plain,
! [A_89] : theorem(or(not(A_89),A_89)),
inference(resolution,[status(thm)],[c_4,c_428]) ).
tff(c_459,plain,
! [A_89] : theorem(or(A_89,not(A_89))),
inference(resolution,[status(thm)],[c_449,c_40]) ).
tff(c_16,plain,
! [Y_17,Z_16,X_15] :
( ~ theorem(or(not(Y_17),Z_16))
| ~ axiom(or(not(X_15),Y_17))
| theorem(or(not(X_15),Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_4273,plain,
! [X_560,Y_561,B_562,C_563] :
( ~ axiom(or(not(X_560),Y_561))
| theorem(or(not(X_560),or(B_562,C_563)))
| ~ theorem(or(not(Y_561),C_563)) ),
inference(resolution,[status(thm)],[c_195,c_16]) ).
tff(c_4916,plain,
! [A_648,B_649,C_650,B_651] :
( theorem(or(not(A_648),or(B_649,C_650)))
| ~ theorem(or(not(or(B_651,A_648)),C_650)) ),
inference(resolution,[status(thm)],[c_4,c_4273]) ).
tff(c_6041,plain,
! [A_749,B_750,B_751] : theorem(or(not(A_749),or(B_750,not(not(or(B_751,A_749)))))),
inference(resolution,[status(thm)],[c_459,c_4916]) ).
tff(c_101,plain,
! [A_34,B_35,C_36] :
( ~ theorem(or(A_34,or(B_35,C_36)))
| theorem(or(B_35,or(A_34,C_36))) ),
inference(resolution,[status(thm)],[c_97,c_14]) ).
tff(c_6090,plain,
! [B_756,A_757,B_758] : theorem(or(B_756,or(not(A_757),not(not(or(B_758,A_757)))))),
inference(resolution,[status(thm)],[c_6041,c_101]) ).
tff(c_6131,plain,
! [A_759,B_760] : theorem(or(not(A_759),not(not(or(B_760,A_759))))),
inference(resolution,[status(thm)],[c_6090,c_29]) ).
tff(c_6141,plain,
! [B_760,A_759] : theorem(or(not(not(or(B_760,A_759))),not(A_759))),
inference(resolution,[status(thm)],[c_6131,c_40]) ).
tff(c_18,plain,
~ theorem(or(not(not(or(p,q))),or(not(p),not(q)))),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_212,plain,
~ theorem(or(not(not(or(p,q))),not(q))),
inference(resolution,[status(thm)],[c_195,c_18]) ).
tff(c_6144,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6141,c_212]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL203-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % 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.10/0.37 % Computer : n004.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 : Fri Sep 4 19:37:14 UTC 2026
% 0.10/0.37 % CPUTime :
% 11.92/4.94 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.92/4.95
% 11.92/4.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------