%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN935+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/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 : 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:08:28 PM UTC 2025
% Result : Theorem 2.35s 1.52s
% Output : CNFRefutation 2.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 4 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 6 ( 5 !; 1 ?; 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] :
( p(X)
=> c )
<=> ( ! [X] : p(X)
=> c ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tff(c_4,plain,
! [X_1,X_2] :
( p(X_1)
| p(X_2) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_22,plain,
! [X_2] : p(X_2),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_8,plain,
~ c,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_18,plain,
( ~ p('#skF_1')
| c
| ~ p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_20,plain,
( ~ p('#skF_1')
| ~ p('#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_8,c_18]) ).
tff(c_27,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_22,c_20]) ).
tff(c_28,plain,
! [X_1] : p(X_1),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_35,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_28,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SYN935+1 : TPTP v9.0.0. Released v3.1.0.
% 0.02/0.12 % 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.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 08:41:48 EDT 2025
% 0.13/0.33 % CPUTime :
% 2.35/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.35/1.53
% 2.35/1.53 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------