TSTP Solution File: SYO895_9 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO895_9 : 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 : n016.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:36 EDT 2023
% Result : Theorem 2.13s 1.60s
% Output : CNFRefutation 2.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 16 ( 7 ~; 3 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 6 ( 6 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 5 (; 5 !; 0 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > 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(q,type,
q: $ki_world > $o ).
tff('#skF_2',type,
'#skF_2': $ki_world ).
tff('#skF_1',type,
'#skF_1': $ki_world > $ki_world ).
tff(f_48,negated_conjecture,
~ ( ( ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> p(W) )
& ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> q(W) ) )
=> ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( p(W)
& q(W) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(c_4,plain,
( ~ q('#skF_2')
| ~ p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_12,plain,
~ p('#skF_2'),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_6,plain,
$ki_accessible($ki_local_world,'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_13,plain,
! [W_6: $ki_world] :
( p(W_6)
| ~ $ki_accessible($ki_local_world,W_6) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_20,plain,
p('#skF_2'),
inference(resolution,[status(thm)],[c_6,c_13]) ).
tff(c_25,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_20]) ).
tff(c_26,plain,
~ q('#skF_2'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_28,plain,
! [W_7: $ki_world] :
( q(W_7)
| ~ $ki_accessible($ki_local_world,W_7) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_35,plain,
q('#skF_2'),
inference(resolution,[status(thm)],[c_6,c_28]) ).
tff(c_40,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO895_9 : 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.13/0.35 % Computer : n016.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:29:22 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.13/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.13/1.61
% 2.13/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.79/1.63
% 2.79/1.63 Inference rules
% 2.79/1.63 ----------------------
% 2.79/1.63 #Ref : 0
% 2.79/1.63 #Sup : 4
% 2.79/1.63 #Fact : 0
% 2.79/1.63 #Define : 0
% 2.79/1.63 #Split : 1
% 2.79/1.63 #Chain : 0
% 2.79/1.63 #Close : 0
% 2.79/1.63
% 2.79/1.63 Ordering : KBO
% 2.79/1.63
% 2.79/1.63 Simplification rules
% 2.79/1.63 ----------------------
% 2.79/1.63 #Subsume : 0
% 2.79/1.63 #Demod : 0
% 2.79/1.63 #Tautology : 0
% 2.79/1.63 #SimpNegUnit : 2
% 2.79/1.63 #BackRed : 0
% 2.79/1.63
% 2.79/1.63 #Partial instantiations: 0
% 2.79/1.63 #Strategies tried : 1
% 2.79/1.63
% 2.79/1.63 Timing (in seconds)
% 2.79/1.63 ----------------------
% 2.79/1.63 Preprocessing : 0.43
% 2.79/1.63 Parsing : 0.26
% 2.79/1.63 CNF conversion : 0.03
% 2.79/1.63 Main loop : 0.15
% 2.79/1.63 Inferencing : 0.07
% 2.79/1.63 Reduction : 0.03
% 2.79/1.63 Demodulation : 0.02
% 2.79/1.64 BG Simplification : 0.01
% 2.79/1.64 Subsumption : 0.02
% 2.79/1.64 Abstraction : 0.00
% 2.79/1.64 MUC search : 0.00
% 2.79/1.64 Cooper : 0.00
% 2.79/1.64 Total : 0.63
% 2.79/1.64 Index Insertion : 0.00
% 2.79/1.64 Index Deletion : 0.00
% 2.79/1.64 Index Matching : 0.00
% 2.79/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------