TSTP Solution File: SYO902_8 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO902_8 : TPTP v8.2.0. Released v8.2.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 : n025.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 : Tue Aug 22 11:18:37 EDT 2023
% Result : Theorem 2.79s 1.60s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 25 ( 12 ~; 7 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 6 ( 6 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 13 (; 9 !; 4 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
tff($ki_world,type,
$ki_world: $tType ).
%Background operators:
%Foreground operators:
tff(p,type,
p: $ki_world > $o ).
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] : $ki_accessible(W,W),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f_49,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)
& p(W0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(c_2,plain,
! [W_1: $ki_world] : $ki_accessible(W_1,W_1),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_8,plain,
! [W0_5: $ki_world] :
( p('#skF_2'(W0_5))
| ~ $ki_accessible('#skF_1',W0_5) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_10,plain,
! [W0_5: $ki_world] :
( $ki_accessible(W0_5,'#skF_2'(W0_5))
| ~ $ki_accessible('#skF_1',W0_5) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_14,plain,
! [W0_13: $ki_world,W_14: $ki_world] :
( ~ p(W0_13)
| ~ $ki_accessible(W_14,W0_13)
| ~ $ki_accessible($ki_local_world,W_14) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_42,plain,
! [W0_16: $ki_world] :
( ~ p('#skF_2'(W0_16))
| ~ $ki_accessible($ki_local_world,W0_16)
| ~ $ki_accessible('#skF_1',W0_16) ),
inference(resolution,[status(thm)],[c_10,c_14]) ).
tff(c_47,plain,
! [W0_17: $ki_world] :
( ~ $ki_accessible($ki_local_world,W0_17)
| ~ $ki_accessible('#skF_1',W0_17) ),
inference(resolution,[status(thm)],[c_8,c_42]) ).
tff(c_58,plain,
~ $ki_accessible('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_6,c_47]) ).
tff(c_64,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO902_8 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 16:16:34 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.79/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.61
% 2.79/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.82/1.63
% 2.82/1.63 Inference rules
% 2.82/1.63 ----------------------
% 2.82/1.63 #Ref : 0
% 2.82/1.63 #Sup : 10
% 2.82/1.63 #Fact : 0
% 2.82/1.63 #Define : 0
% 2.82/1.63 #Split : 1
% 2.82/1.63 #Chain : 0
% 2.82/1.63 #Close : 0
% 2.82/1.63
% 2.82/1.63 Ordering : KBO
% 2.82/1.63
% 2.82/1.63 Simplification rules
% 2.82/1.63 ----------------------
% 2.82/1.63 #Subsume : 4
% 2.82/1.63 #Demod : 2
% 2.82/1.63 #Tautology : 0
% 2.82/1.63 #SimpNegUnit : 0
% 2.82/1.63 #BackRed : 0
% 2.82/1.63
% 2.82/1.63 #Partial instantiations: 0
% 2.82/1.63 #Strategies tried : 1
% 2.82/1.63
% 2.82/1.63 Timing (in seconds)
% 2.82/1.63 ----------------------
% 2.82/1.63 Preprocessing : 0.42
% 2.82/1.63 Parsing : 0.26
% 2.82/1.63 CNF conversion : 0.02
% 2.82/1.63 Main loop : 0.17
% 2.82/1.63 Inferencing : 0.08
% 2.82/1.63 Reduction : 0.03
% 2.82/1.63 Demodulation : 0.02
% 2.82/1.63 BG Simplification : 0.01
% 2.82/1.63 Subsumption : 0.05
% 2.82/1.63 Abstraction : 0.01
% 2.82/1.63 MUC search : 0.00
% 2.82/1.63 Cooper : 0.00
% 2.82/1.63 Total : 0.64
% 2.82/1.64 Index Insertion : 0.00
% 2.82/1.64 Index Deletion : 0.00
% 2.82/1.64 Index Matching : 0.00
% 2.82/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------