%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN944+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 : n015.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:29 PM UTC 2025
% Result : Theorem 2.66s 1.61s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 17 ( 6 ~; 3 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 13 ( 11 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > s > p > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: ( $i * $i ) > $o ).
tff(p,type,
p: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(s,type,
s: $i > $o ).
tff(r,type,
r: ( $i * $i ) > $o ).
tff(f_46,negated_conjecture,
~ ! [A,B,C] :
( ( s(A)
& s(B)
& r(B,C)
& ! [X] :
( s(X)
=> p(X) )
& ! [X,Y] :
( r(X,Y)
=> q(X,Y) ) )
=> ? [X,Y] :
( p(X)
& q(X,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tff(c_10,plain,
s('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_13,plain,
! [X_11] :
( p(X_11)
| ~ s(X_11) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_20,plain,
p('#skF_2'),
inference(resolution,[status(thm)],[c_10,c_13]) ).
tff(c_8,plain,
r('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_23,plain,
! [X_14,Y_15] :
( q(X_14,Y_15)
| ~ r(X_14,Y_15) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_27,plain,
q('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_8,c_23]) ).
tff(c_2,plain,
! [X_9,Y_10] :
( ~ q(X_9,Y_10)
| ~ p(X_9) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_30,plain,
~ p('#skF_2'),
inference(resolution,[status(thm)],[c_27,c_2]) ).
tff(c_34,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN944+1 : TPTP v9.0.0. Released v3.1.0.
% 0.12/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 : n015.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 08:42:05 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.66/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.61
% 2.66/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------