%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN045+1 : TPTP v9.0.0. Released v2.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 : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Apr 9 10:02:15 PM UTC 2025
% Result : Theorem 2.15s 1.46s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 13 ( 4 ~; 6 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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_39,negated_conjecture,
~ ( ( p
| ( q
& r ) )
<=> ( ( p
| q )
& ( p
| r ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel13) ).
tff(c_20,plain,
~ p,
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_48,plain,
( q
| p ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_49,plain,
q,
inference(negUnitSimplification,[status(thm)],[c_20,c_48]) ).
tff(c_34,plain,
( r
| p ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_50,plain,
r,
inference(negUnitSimplification,[status(thm)],[c_20,c_34]) ).
tff(c_2,plain,
( ~ r
| ~ q ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_64,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_49,c_50,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SYN045+1 : TPTP v9.0.0. Released v2.0.0.
% 0.02/0.13 % 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.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Apr 9 06:52:56 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.15/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.15/1.46
% 2.15/1.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------