%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN391+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/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 : n003.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:03:26 PM UTC 2025
% Result : Theorem 2.39s 1.55s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 8 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 2 usr; 3 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > p2 > p1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p2,type,
p2: $o ).
tff(p1,type,
p1: $o ).
tff(f_47,negated_conjecture,
~ ( ( ( p1
| p2 )
& ( ~ p1
| p2 )
& ( p1
| ~ p2 ) )
=> ~ ( ~ p1
| ~ p2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel9) ).
tff(c_8,plain,
( p2
| p1 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_9,plain,
p1,
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_6,plain,
( p2
| ~ p1 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_11,plain,
p2,
inference(demodulation,[status(thm),theory(equality)],[c_9,c_6]) ).
tff(c_2,plain,
( ~ p2
| ~ p1 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_15,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9,c_11,c_2]) ).
tff(c_17,plain,
~ p1,
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_16,plain,
p2,
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_4,plain,
( ~ p2
| p1 ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_19,plain,
p1,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_4]) ).
tff(c_20,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_17,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN391+1 : TPTP v9.0.0. Released v2.0.0.
% 0.03/0.13 % 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.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Apr 9 07:22:18 EDT 2025
% 0.13/0.33 % CPUTime :
% 2.39/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.39/1.56
% 2.39/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------