TSTP Solution File: SYO894_8 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO894_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 : n021.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 3.05s 1.79s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 25 unt; 4 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 61 ( 36 ~; 21 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 27 ( 27 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 14 (; 13 !; 1 ?; 14 :)
% 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 ).
tff('#skF_1',type,
'#skF_1': $ki_world ).
tff(f_44,negated_conjecture,
~ ( ! [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
=> ( p(W)
=> ~ p(W) ) )
<=> ~ ? [W: $ki_world] :
( $ki_accessible($ki_local_world,W)
& p(W) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(c_4,plain,
( p('#skF_1')
| p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_22,plain,
p('#skF_2'),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_10,plain,
( p('#skF_1')
| $ki_accessible($ki_local_world,'#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_24,plain,
$ki_accessible($ki_local_world,'#skF_2'),
inference(splitLeft,[status(thm)],[c_10]) ).
tff(c_16,plain,
! [W_3: $ki_world] :
( p('#skF_1')
| ~ p(W_3)
| ~ $ki_accessible($ki_local_world,W_3) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_29,plain,
! [W_5: $ki_world] :
( ~ p(W_5)
| ~ $ki_accessible($ki_local_world,W_5) ),
inference(splitLeft,[status(thm)],[c_16]) ).
tff(c_32,plain,
~ p('#skF_2'),
inference(resolution,[status(thm)],[c_24,c_29]) ).
tff(c_40,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_32]) ).
tff(c_41,plain,
p('#skF_1'),
inference(splitRight,[status(thm)],[c_16]) ).
tff(c_18,plain,
! [W_3: $ki_world] :
( $ki_accessible($ki_local_world,'#skF_1')
| ~ p(W_3)
| ~ $ki_accessible($ki_local_world,W_3) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_44,plain,
! [W_6: $ki_world] :
( ~ p(W_6)
| ~ $ki_accessible($ki_local_world,W_6) ),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_47,plain,
~ p('#skF_2'),
inference(resolution,[status(thm)],[c_24,c_44]) ).
tff(c_55,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_22,c_47]) ).
tff(c_56,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_20,plain,
! [W_2: $ki_world,W_3: $ki_world] :
( ~ p(W_2)
| ~ $ki_accessible($ki_local_world,W_2)
| ~ p(W_3)
| ~ $ki_accessible($ki_local_world,W_3) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_58,plain,
! [W_7: $ki_world] :
( ~ p(W_7)
| ~ $ki_accessible($ki_local_world,W_7) ),
inference(splitLeft,[status(thm)],[c_20]) ).
tff(c_61,plain,
~ p('#skF_1'),
inference(resolution,[status(thm)],[c_56,c_58]) ).
tff(c_72,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_41,c_61]) ).
tff(c_74,plain,
! [W_8: $ki_world] :
( ~ p(W_8)
| ~ $ki_accessible($ki_local_world,W_8) ),
inference(splitRight,[status(thm)],[c_20]) ).
tff(c_77,plain,
~ p('#skF_1'),
inference(resolution,[status(thm)],[c_56,c_74]) ).
tff(c_88,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_41,c_77]) ).
tff(c_89,plain,
p('#skF_1'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_12,plain,
( $ki_accessible($ki_local_world,'#skF_1')
| $ki_accessible($ki_local_world,'#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_91,plain,
$ki_accessible($ki_local_world,'#skF_2'),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_90,plain,
~ $ki_accessible($ki_local_world,'#skF_2'),
inference(splitRight,[status(thm)],[c_10]) ).
tff(c_93,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_91,c_90]) ).
tff(c_94,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_95,plain,
~ $ki_accessible($ki_local_world,'#skF_2'),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_14,plain,
! [W_2: $ki_world] :
( ~ p(W_2)
| ~ $ki_accessible($ki_local_world,W_2)
| $ki_accessible($ki_local_world,'#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_100,plain,
! [W_9: $ki_world] :
( ~ p(W_9)
| ~ $ki_accessible($ki_local_world,W_9) ),
inference(negUnitSimplification,[status(thm)],[c_95,c_14]) ).
tff(c_103,plain,
~ p('#skF_1'),
inference(resolution,[status(thm)],[c_94,c_100]) ).
tff(c_111,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_89,c_103]) ).
tff(c_112,plain,
p('#skF_1'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_113,plain,
~ p('#skF_2'),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_6,plain,
( $ki_accessible($ki_local_world,'#skF_1')
| p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_115,plain,
$ki_accessible($ki_local_world,'#skF_1'),
inference(negUnitSimplification,[status(thm)],[c_113,c_6]) ).
tff(c_8,plain,
! [W_2: $ki_world] :
( ~ p(W_2)
| ~ $ki_accessible($ki_local_world,W_2)
| p('#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_118,plain,
! [W_10: $ki_world] :
( ~ p(W_10)
| ~ $ki_accessible($ki_local_world,W_10) ),
inference(negUnitSimplification,[status(thm)],[c_113,c_8]) ).
tff(c_121,plain,
~ p('#skF_1'),
inference(resolution,[status(thm)],[c_115,c_118]) ).
tff(c_129,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_112,c_121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0.
% 0.13/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 : n021.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:04:51 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.05/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.05/1.80
% 3.05/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.16/1.83
% 3.16/1.83 Inference rules
% 3.16/1.83 ----------------------
% 3.16/1.83 #Ref : 0
% 3.16/1.83 #Sup : 14
% 3.16/1.83 #Fact : 0
% 3.16/1.83 #Define : 0
% 3.16/1.83 #Split : 6
% 3.16/1.83 #Chain : 0
% 3.16/1.83 #Close : 0
% 3.16/1.83
% 3.16/1.83 Ordering : KBO
% 3.16/1.83
% 3.16/1.83 Simplification rules
% 3.16/1.83 ----------------------
% 3.16/1.83 #Subsume : 1
% 3.16/1.83 #Demod : 17
% 3.16/1.83 #Tautology : 10
% 3.16/1.83 #SimpNegUnit : 3
% 3.16/1.83 #BackRed : 0
% 3.16/1.83
% 3.16/1.83 #Partial instantiations: 0
% 3.16/1.83 #Strategies tried : 1
% 3.16/1.83
% 3.16/1.83 Timing (in seconds)
% 3.16/1.83 ----------------------
% 3.16/1.83 Preprocessing : 0.48
% 3.16/1.83 Parsing : 0.29
% 3.16/1.83 CNF conversion : 0.02
% 3.16/1.83 Main loop : 0.22
% 3.16/1.83 Inferencing : 0.09
% 3.16/1.83 Reduction : 0.05
% 3.16/1.83 Demodulation : 0.03
% 3.16/1.83 BG Simplification : 0.02
% 3.16/1.83 Subsumption : 0.05
% 3.16/1.83 Abstraction : 0.01
% 3.16/1.83 MUC search : 0.00
% 3.16/1.83 Cooper : 0.00
% 3.16/1.83 Total : 0.74
% 3.16/1.83 Index Insertion : 0.00
% 3.16/1.84 Index Deletion : 0.00
% 3.16/1.84 Index Matching : 0.00
% 3.16/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------