%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYO893_11 : TPTP v9.0.0. Released v8.2.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 : n014.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:38:30 PM UTC 2025
% Result : Theorem 2.60s 1.60s
% Output : CNFRefutation 2.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 10 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 4 ( 4 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 22 ( 19 !; 3 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > #skF_6 > #skF_5 > #skF_3 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
tff($ki_world,type,
$ki_world: $tType ).
%Background operators:
%Foreground operators:
tff('#skF_6',type,
'#skF_6': $ki_world > $ki_world ).
tff('#skF_5',type,
'#skF_5': $ki_world > $ki_world ).
tff('#skF_3',type,
'#skF_3': $ki_world > $ki_world ).
tff(p,type,
p: $ki_world > $o ).
tff('#skF_4',type,
'#skF_4': $ki_world ).
tff('#skF_2',type,
'#skF_2': $ki_world > $ki_world ).
tff('#skF_1',type,
'#skF_1': $ki_world ).
tff(f_30,axiom,
! [W: $ki_world,V: $ki_world] : $ki_accessible(W,V),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_universal) ).
tff(f_54,negated_conjecture,
~ ( ~ ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ? [W0: $ki_world] :
( $ki_accessible(W,W0)
& ! [W1: $ki_world] :
( $ki_accessible(W0,W1)
=> p(W1) ) ) )
<=> ? [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
& ! [W0: $ki_world] :
( $ki_accessible(W,W0)
=> ? [W1: $ki_world] :
( $ki_accessible(W0,W1)
& ~ p(W1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(c_2,plain,
! [W_1: $ki_world,V_2: $ki_world] : $ki_accessible(W_1,V_2),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
! [W1_13: $ki_world,W_8: $ki_world,W1_24: $ki_world,W_19: $ki_world] :
( p(W1_13)
| ~ $ki_accessible('#skF_3'(W_8),W1_13)
| ~ $ki_accessible($ki_local_world,W_8)
| p(W1_24)
| ~ $ki_accessible('#skF_6'(W_19),W1_24)
| ~ $ki_accessible($ki_local_world,W_19) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_99,plain,
! [W1_13: $ki_world,W1_24: $ki_world] :
( p(W1_13)
| p(W1_24) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_2,c_6]) ).
tff(c_103,plain,
! [W1_24: $ki_world] : p(W1_24),
inference(splitLeft,[status(thm)],[c_99]) ).
tff(c_30,plain,
! [W0_6: $ki_world,W0_17: $ki_world] :
( ~ p('#skF_2'(W0_6))
| ~ $ki_accessible('#skF_1',W0_6)
| ~ p('#skF_5'(W0_17))
| ~ $ki_accessible('#skF_4',W0_17) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_63,plain,
! [W0_6: $ki_world,W0_17: $ki_world] :
( ~ p('#skF_2'(W0_6))
| ~ p('#skF_5'(W0_17)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_30]) ).
tff(c_110,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_103,c_103,c_63]) ).
tff(c_111,plain,
! [W1_13: $ki_world] : p(W1_13),
inference(splitRight,[status(thm)],[c_99]) ).
tff(c_118,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_111,c_111,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : SYO893_11 : TPTP v9.0.0. Released v8.2.0.
% 0.02/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.32 % Computer : n014.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Wed Apr 9 10:23:34 EDT 2025
% 0.13/0.32 % CPUTime :
% 2.60/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.60/1.60
% 2.60/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------