%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN934+1 : TPTP v9.0.0. Released v3.1.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 : n010.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:08:28 PM UTC 2025
% Result : Theorem 2.47s 1.60s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 4 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 6 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > c > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(c,type,
c: $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_35,negated_conjecture,
~ ( ? [X] :
( c
=> p(X) )
<=> ( c
=> ? [X] : p(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_8,plain,
! [X_1,X_2] :
( ~ p(X_1)
| ~ p(X_2) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_36,plain,
! [X_2] : ~ p(X_2),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_28,plain,
! [X_2] : ~ p(X_2),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_4,plain,
c,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_18,plain,
( p('#skF_1')
| p('#skF_2')
| ~ c ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_25,plain,
( p('#skF_1')
| p('#skF_2') ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_18]) ).
tff(c_27,plain,
p('#skF_2'),
inference(splitLeft,[status(thm)],[c_25]) ).
tff(c_30,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_27]) ).
tff(c_31,plain,
! [X_1] : ~ p(X_1),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_33,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_31,c_27]) ).
tff(c_34,plain,
p('#skF_1'),
inference(splitRight,[status(thm)],[c_25]) ).
tff(c_38,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_34]) ).
tff(c_39,plain,
! [X_1] : ~ p(X_1),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_41,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_39,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN934+1 : TPTP v9.0.0. Released v3.1.0.
% 0.04/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.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Apr 9 08:42:19 EDT 2025
% 0.13/0.35 % CPUTime :
% 2.47/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.47/1.60
% 2.47/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------