TSTP Solution File: SYO900_11 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO900_11 : 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 : n026.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.17s 1.57s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 14 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 13 ( 3 ~; 2 |; 0 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 2 ( 2 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 12 (; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_4 > #skF_2 > #skF_1 > #skF_3
%Foreground sorts:
tff($ki_world,type,
$ki_world: $tType ).
%Background operators:
%Foreground operators:
tff(p,type,
p: $ki_world > $o ).
tff(q,type,
q: $ki_world > $o ).
tff('#skF_4',type,
'#skF_4': $ki_world ).
tff('#skF_2',type,
'#skF_2': $ki_world ).
tff('#skF_1',type,
'#skF_1': $ki_world ).
tff('#skF_3',type,
'#skF_3': $ki_world ).
tff(f_30,axiom,
! [W: $ki_world,V: $ki_world] : $ki_accessible(W,V),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f_56,negated_conjecture,
~ ( ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( ! [W0: $ki_world] :
( $ki_accessible(W,W0)
=> p(W0) )
=> ! [W0: $ki_world] :
( $ki_accessible(W,W0)
=> q(W0) ) ) )
| ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( ! [W0: $ki_world] :
( $ki_accessible(W,W0)
=> q(W0) )
=> ! [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,V_2: $ki_world] : $ki_accessible(W_1,V_2),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_8,plain,
! [W0_8: $ki_world] :
( q(W0_8)
| ~ $ki_accessible('#skF_3',W0_8) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_23,plain,
! [W0_8: $ki_world] : q(W0_8),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_8]) ).
tff(c_12,plain,
~ q('#skF_2'),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_28,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO900_11 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.13 % 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.35 % Computer : n026.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 : Thu Aug 3 16:12:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.17/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.17/1.57
% 2.17/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.17/1.61
% 2.17/1.61 Inference rules
% 2.17/1.61 ----------------------
% 2.17/1.61 #Ref : 0
% 2.17/1.61 #Sup : 0
% 2.17/1.61 #Fact : 0
% 2.17/1.61 #Define : 0
% 2.17/1.61 #Split : 0
% 2.17/1.61 #Chain : 0
% 2.17/1.61 #Close : 0
% 2.17/1.61
% 2.17/1.61 Ordering : KBO
% 2.17/1.61
% 2.17/1.61 Simplification rules
% 2.17/1.61 ----------------------
% 2.17/1.61 #Subsume : 4
% 2.17/1.61 #Demod : 8
% 2.17/1.61 #Tautology : 4
% 2.17/1.61 #SimpNegUnit : 0
% 2.17/1.61 #BackRed : 0
% 2.17/1.61
% 2.17/1.61 #Partial instantiations: 0
% 2.17/1.61 #Strategies tried : 1
% 2.17/1.61
% 2.17/1.61 Timing (in seconds)
% 2.17/1.61 ----------------------
% 2.17/1.62 Preprocessing : 0.46
% 2.17/1.62 Parsing : 0.27
% 2.17/1.62 CNF conversion : 0.03
% 2.17/1.62 Main loop : 0.07
% 2.17/1.62 Inferencing : 0.00
% 2.17/1.62 Reduction : 0.03
% 2.17/1.62 Demodulation : 0.03
% 2.17/1.62 BG Simplification : 0.01
% 2.17/1.62 Subsumption : 0.03
% 2.17/1.62 Abstraction : 0.00
% 2.17/1.62 MUC search : 0.00
% 2.17/1.62 Cooper : 0.00
% 2.17/1.62 Total : 0.59
% 2.17/1.62 Index Insertion : 0.00
% 2.17/1.62 Index Deletion : 0.00
% 2.17/1.62 Index Matching : 0.00
% 2.17/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------