%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN393+1.003 : 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 : n021.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.96s 1.78s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 29 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 46 ( 20 ~; 21 |; 0 &)
% ( 5 <=>; 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 > p3 > p2 > p1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p3,type,
p3: $o ).
tff(p2,type,
p2: $o ).
tff(p1,type,
p1: $o ).
tff(f_41,negated_conjecture,
~ ( ( ( p1
<=> p2 )
<=> p3 )
<=> ( p1
<=> ( p2
<=> p3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel12) ).
tff(c_876,plain,
( p3
| ~ p2
| ~ p1 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_883,plain,
~ p1,
inference(splitLeft,[status(thm)],[c_876]) ).
tff(c_662,plain,
( ~ p3
| ~ p2
| p1 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_884,plain,
( ~ p3
| ~ p2 ),
inference(negUnitSimplification,[status(thm)],[c_883,c_662]) ).
tff(c_885,plain,
~ p2,
inference(splitLeft,[status(thm)],[c_884]) ).
tff(c_798,plain,
( p2
| p3
| p1 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_886,plain,
p3,
inference(negUnitSimplification,[status(thm)],[c_883,c_885,c_798]) ).
tff(c_390,plain,
( ~ p3
| p1
| p2 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_897,plain,
( p1
| p2 ),
inference(demodulation,[status(thm),theory(equality)],[c_886,c_390]) ).
tff(c_898,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_885,c_883,c_897]) ).
tff(c_899,plain,
~ p3,
inference(splitRight,[status(thm)],[c_884]) ).
tff(c_900,plain,
p2,
inference(splitRight,[status(thm)],[c_884]) ).
tff(c_568,plain,
( p1
| ~ p2
| p3 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_904,plain,
( p1
| p3 ),
inference(demodulation,[status(thm),theory(equality)],[c_900,c_568]) ).
tff(c_905,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_899,c_883,c_904]) ).
tff(c_907,plain,
p1,
inference(splitRight,[status(thm)],[c_876]) ).
tff(c_906,plain,
( ~ p2
| p3 ),
inference(splitRight,[status(thm)],[c_876]) ).
tff(c_908,plain,
~ p2,
inference(splitLeft,[status(thm)],[c_906]) ).
tff(c_598,plain,
( p2
| ~ p1
| p3 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_910,plain,
( p2
| p3 ),
inference(demodulation,[status(thm),theory(equality)],[c_907,c_598]) ).
tff(c_911,plain,
p3,
inference(negUnitSimplification,[status(thm)],[c_908,c_910]) ).
tff(c_832,plain,
( p2
| ~ p3
| ~ p1 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_918,plain,
p2,
inference(demodulation,[status(thm),theory(equality)],[c_907,c_911,c_832]) ).
tff(c_919,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_908,c_918]) ).
tff(c_921,plain,
p2,
inference(splitRight,[status(thm)],[c_906]) ).
tff(c_920,plain,
p3,
inference(splitRight,[status(thm)],[c_906]) ).
tff(c_4,plain,
( ~ p3
| ~ p2
| ~ p1 ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_934,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_907,c_921,c_920,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN393+1.003 : 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.12/0.34 % Computer : n021.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:44 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.96/1.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.96/1.79
% 2.96/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------