%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL201-3 : 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 : n028.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 34.78s 21.09s
% Output : CNFRefutation 34.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 25 unt; 0 typ; 0 def)
% Number of atoms : 65 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 51 ( 27 ~; 24 |; 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 92 ( 92 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > #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(implies,type,
implies: ( $i * $i ) > $i ).
tff(f_56,axiom,
! [X,Y] : ( implies(X,Y) = or(not(X),Y) ),
file(unknown,unknown) ).
tff(f_50,axiom,
! [A,B] : axiom(implies(or(A,B),or(B,A))),
file(unknown,unknown) ).
tff(f_48,axiom,
! [A,B] : axiom(implies(A,or(B,A))),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X] :
( theorem(X)
| ~ axiom(X) ),
file(unknown,unknown) ).
tff(f_54,axiom,
! [A,B,C] : axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y] :
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
file(unknown,unknown) ).
tff(f_77,axiom,
~ theorem(implies(not(or(p,q)),or(not(p),q))),
file(unknown,unknown) ).
tff(c_12,plain,
! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_40,plain,
! [A_25,B_26] : axiom(implies(or(A_25,B_26),or(B_26,A_25))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_46,plain,
! [Y_13,X_12] : axiom(implies(or(Y_13,not(X_12)),implies(X_12,Y_13))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_40]) ).
tff(c_4,plain,
! [A_2,B_3] : axiom(implies(A_2,or(B_3,A_2))),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_14,plain,
! [X_14] :
( ~ axiom(X_14)
| theorem(X_14) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_145,plain,
! [A_41,B_42,C_43] : axiom(implies(implies(A_41,B_42),implies(or(C_43,A_41),or(C_43,B_42)))),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_151,plain,
! [Y_13,B_42,X_12] : axiom(implies(implies(Y_13,B_42),implies(implies(X_12,Y_13),or(not(X_12),B_42)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_145]) ).
tff(c_307,plain,
! [Y_68,B_69,X_70] : axiom(implies(implies(Y_68,B_69),implies(implies(X_70,Y_68),implies(X_70,B_69)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_151]) ).
tff(c_47,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| ~ theorem(implies(Y_27,X_28))
| theorem(X_28) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_51,plain,
! [Y_27,X_28] :
( ~ theorem(Y_27)
| theorem(X_28)
| ~ axiom(implies(Y_27,X_28)) ),
inference(resolution,[status(thm)],[c_14,c_47]) ).
tff(c_722,plain,
! [Y_133,B_134,X_135] :
( ~ theorem(implies(Y_133,B_134))
| theorem(implies(implies(X_135,Y_133),implies(X_135,B_134))) ),
inference(resolution,[status(thm)],[c_307,c_51]) ).
tff(c_16,plain,
! [Y_16,X_15] :
( ~ theorem(Y_16)
| ~ theorem(implies(Y_16,X_15))
| theorem(X_15) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_2276,plain,
! [X_270,Y_271,B_272] :
( ~ theorem(implies(X_270,Y_271))
| theorem(implies(X_270,B_272))
| ~ theorem(implies(Y_271,B_272)) ),
inference(resolution,[status(thm)],[c_722,c_16]) ).
tff(c_7583,plain,
! [X_547,B_548,Y_549] :
( theorem(implies(X_547,B_548))
| ~ theorem(implies(Y_549,B_548))
| ~ axiom(implies(X_547,Y_549)) ),
inference(resolution,[status(thm)],[c_14,c_2276]) ).
tff(c_15188,plain,
! [X_845,B_846,Y_847] :
( theorem(implies(X_845,B_846))
| ~ axiom(implies(X_845,Y_847))
| ~ axiom(implies(Y_847,B_846)) ),
inference(resolution,[status(thm)],[c_14,c_7583]) ).
tff(c_16077,plain,
! [A_870,B_871,B_872] :
( theorem(implies(A_870,B_871))
| ~ axiom(implies(or(B_872,A_870),B_871)) ),
inference(resolution,[status(thm)],[c_4,c_15188]) ).
tff(c_16228,plain,
! [X_875,Y_876] : theorem(implies(not(X_875),implies(X_875,Y_876))),
inference(resolution,[status(thm)],[c_46,c_16077]) ).
tff(c_74,plain,
! [A_32,B_33,C_34] : axiom(implies(or(A_32,or(B_33,C_34)),or(B_33,or(A_32,C_34)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_91,plain,
! [A_32,X_12,C_34] : axiom(implies(or(A_32,or(not(X_12),C_34)),implies(X_12,or(A_32,C_34)))),
inference(superposition,[status(thm),theory(equality)],[c_12,c_74]) ).
tff(c_404,plain,
! [A_86,X_87,C_88] : axiom(implies(or(A_86,implies(X_87,C_88)),implies(X_87,or(A_86,C_88)))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_91]) ).
tff(c_1197,plain,
! [A_180,X_181,C_182] :
( ~ theorem(or(A_180,implies(X_181,C_182)))
| theorem(implies(X_181,or(A_180,C_182))) ),
inference(resolution,[status(thm)],[c_404,c_51]) ).
tff(c_1249,plain,
! [X_12,X_181,C_182] :
( ~ theorem(implies(X_12,implies(X_181,C_182)))
| theorem(implies(X_181,or(not(X_12),C_182))) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_1197]) ).
tff(c_1266,plain,
! [X_12,X_181,C_182] :
( ~ theorem(implies(X_12,implies(X_181,C_182)))
| theorem(implies(X_181,implies(X_12,C_182))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1249]) ).
tff(c_16287,plain,
! [X_875,Y_876] : theorem(implies(X_875,implies(not(X_875),Y_876))),
inference(resolution,[status(thm)],[c_16228,c_1266]) ).
tff(c_6,plain,
! [A_4,B_5] : axiom(implies(or(A_4,B_5),or(B_5,A_4))),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_16113,plain,
! [B_873,A_874] : theorem(implies(B_873,or(B_873,A_874))),
inference(resolution,[status(thm)],[c_6,c_16077]) ).
tff(c_726,plain,
! [X_135,Y_133,B_134] :
( ~ theorem(implies(X_135,Y_133))
| theorem(implies(X_135,B_134))
| ~ theorem(implies(Y_133,B_134)) ),
inference(resolution,[status(thm)],[c_722,c_16]) ).
tff(c_46828,plain,
! [B_1677,B_1678,A_1679] :
( theorem(implies(B_1677,B_1678))
| ~ theorem(implies(or(B_1677,A_1679),B_1678)) ),
inference(resolution,[status(thm)],[c_16113,c_726]) ).
tff(c_53008,plain,
! [B_1825,A_1826,Y_1827] : theorem(implies(B_1825,implies(not(or(B_1825,A_1826)),Y_1827))),
inference(resolution,[status(thm)],[c_16287,c_46828]) ).
tff(c_53193,plain,
! [B_1825,A_1826,Y_1827] : theorem(implies(not(or(B_1825,A_1826)),implies(B_1825,Y_1827))),
inference(resolution,[status(thm)],[c_53008,c_1266]) ).
tff(c_18,plain,
~ theorem(implies(not(or(p,q)),or(not(p),q))),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_19,plain,
~ theorem(implies(not(or(p,q)),implies(p,q))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).
tff(c_53438,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_53193,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL201-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % 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.09/0.36 % Computer : n028.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 01:10:14 UTC 2026
% 0.09/0.36 % CPUTime :
% 34.78/21.09 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 34.78/21.10
% 34.78/21.10 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------