%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : LCL230-2 : TPTP v9.3.1. Released v1.0.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:34 AM UTC 2026
% Result : Unsatisfiable 1.85s 1.39s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 11 ( 6 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 4 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > r > q > p
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff(q,type,
q: $o ).
tff(r,type,
r: $o ).
tff(f_33,axiom,
~ p,
file(unknown,unknown) ).
tff(f_36,axiom,
~ r,
file(unknown,unknown) ).
tff(f_34,axiom,
q,
file(unknown,unknown) ).
tff(f_31,axiom,
( ~ q
| p
| r ),
file(unknown,unknown) ).
tff(c_4,plain,
~ p,
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_8,plain,
~ r,
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_6,plain,
q,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
( r
| p
| ~ q ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_10,plain,
( r
| p ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_11,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_8,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL230-2 : TPTP v9.3.1. Released v1.0.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.11/0.36 % Computer : n028.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 5 04:32:29 UTC 2026
% 0.12/0.36 % CPUTime :
% 1.85/1.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.85/1.39
% 1.85/1.39 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------