%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN392+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 : n004.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.25s 1.53s
% Output : CNFRefutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 6 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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_40,negated_conjecture,
~ ( ( p1
<=> p2 )
<=> ( ( p2
| ~ p1 )
& ( ~ p2
| p1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel14) ).
tff(c_64,plain,
( ~ p1
| p2 ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_73,plain,
~ p1,
inference(splitLeft,[status(thm)],[c_64]) ).
tff(c_50,plain,
( p1
| ~ p2 ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_74,plain,
~ p2,
inference(negUnitSimplification,[status(thm)],[c_73,c_50]) ).
tff(c_46,plain,
( p1
| p2 ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_75,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_74,c_73,c_46]) ).
tff(c_77,plain,
p1,
inference(splitRight,[status(thm)],[c_64]) ).
tff(c_76,plain,
p2,
inference(splitRight,[status(thm)],[c_64]) ).
tff(c_8,plain,
( ~ p2
| ~ p1 ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_79,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_77,c_76,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN392+1 : TPTP v9.0.0. Released v2.0.0.
% 0.06/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.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Apr 9 07:22:07 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.25/1.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.44/1.53
% 2.44/1.53 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------