TSTP Solution File: SYO888_10 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYO888_10 : 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 : n010.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:35 EDT 2023

% Result   : Theorem 2.84s 1.69s
% Output   : CNFRefutation 3.03s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15  % Problem  : SYO888_10 : TPTP v8.2.0. Released v8.2.0.
% 0.13/0.15  % 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.37  % Computer : n010.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8042.1875MB
% 0.13/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37  % CPULimit : 300
% 0.13/0.37  % WCLimit  : 300
% 0.13/0.37  % DateTime : Thu Aug  3 15:53:13 EDT 2023
% 0.13/0.37  % CPUTime  : 
% 2.84/1.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.84/1.70  
% 2.84/1.70  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.03/1.71  %$ h > g > f > #nlpp > #skF_1 > #skF_2 > #skF_3
% 3.03/1.71  
% 3.03/1.71  %Foreground sorts:
% 3.03/1.71  tff($ki_world, type, $ki_world: $tType ).
% 3.03/1.71  
% 3.03/1.71  %Background operators:
% 3.03/1.71  
% 3.03/1.71  
% 3.03/1.71  %Foreground operators:
% 3.03/1.71  tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 3.03/1.71  tff(f, type, f: ($ki_world * $i) > $o).
% 3.03/1.71  tff(h, type, h: ($ki_world * $i) > $o).
% 3.03/1.71  tff('#skF_2', type, '#skF_2': $i).
% 3.03/1.71  tff(g, type, g: ($ki_world * $i) > $o).
% 3.03/1.71  tff('#skF_3', type, '#skF_3': $ki_world).
% 3.03/1.71  
% 3.03/1.72  tff(f_69, negated_conjecture, ~(((![X]: ($ki_exists_in_world_$i($ki_local_world, X) => (f($ki_local_world, X) => (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => g(W, X)))))) & (![X]: ($ki_exists_in_world_$i($ki_local_world, X) => (g($ki_local_world, X) => (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => h(W, X))))))) => (![X]: ($ki_exists_in_world_$i($ki_local_world, X) => (f($ki_local_world, X) => (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => h(W, X))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', verify)).
% 3.03/1.72  tff(f_30, axiom, (![W:$ki_world]: $ki_accessible(W, W)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mrel_reflexive)).
% 3.03/1.72  tff(c_14, plain, ($ki_exists_in_world_$i($ki_local_world, '#skF_2')), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.03/1.72  tff(c_12, plain, (f($ki_local_world, '#skF_2')), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.03/1.72  tff(c_2, plain, (![W_1:$ki_world]: ($ki_accessible(W_1, W_1))), inference(cnfTransformation, [status(thm)], [f_30])).
% 3.03/1.72  tff(c_18, plain, (![W_9:$ki_world, X_7]: (g(W_9, X_7) | ~$ki_accessible($ki_local_world, W_9) | ~f($ki_local_world, X_7) | ~$ki_exists_in_world_$i($ki_local_world, X_7))), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.03/1.72  tff(c_10, plain, ($ki_accessible($ki_local_world, '#skF_3')), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.03/1.72  tff(c_35, plain, (![W_20:$ki_world, X_21]: (h(W_20, X_21) | ~$ki_accessible($ki_local_world, W_20) | ~g($ki_local_world, X_21) | ~$ki_exists_in_world_$i($ki_local_world, X_21))), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.03/1.72  tff(c_8, plain, (~h('#skF_3', '#skF_2')), inference(cnfTransformation, [status(thm)], [f_69])).
% 3.03/1.72  tff(c_38, plain, (~$ki_accessible($ki_local_world, '#skF_3') | ~g($ki_local_world, '#skF_2') | ~$ki_exists_in_world_$i($ki_local_world, '#skF_2')), inference(resolution, [status(thm)], [c_35, c_8])).
% 3.03/1.72  tff(c_41, plain, (~g($ki_local_world, '#skF_2')), inference(demodulation, [status(thm), theory('equality')], [c_14, c_10, c_38])).
% 3.03/1.72  tff(c_45, plain, (~$ki_accessible($ki_local_world, $ki_local_world) | ~f($ki_local_world, '#skF_2') | ~$ki_exists_in_world_$i($ki_local_world, '#skF_2')), inference(resolution, [status(thm)], [c_18, c_41])).
% 3.03/1.72  tff(c_49, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_14, c_12, c_2, c_45])).
% 3.03/1.72  % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.03/1.72  
% 3.03/1.72  Inference rules
% 3.03/1.72  ----------------------
% 3.03/1.72  #Ref     : 0
% 3.03/1.72  #Sup     : 5
% 3.03/1.72  #Fact    : 0
% 3.03/1.72  #Define  : 0
% 3.03/1.72  #Split   : 0
% 3.03/1.72  #Chain   : 0
% 3.03/1.72  #Close   : 0
% 3.03/1.72  
% 3.03/1.72  Ordering : KBO
% 3.03/1.72  
% 3.03/1.72  Simplification rules
% 3.03/1.72  ----------------------
% 3.03/1.72  #Subsume      : 0
% 3.03/1.72  #Demod        : 6
% 3.03/1.72  #Tautology    : 2
% 3.03/1.72  #SimpNegUnit  : 0
% 3.03/1.72  #BackRed      : 0
% 3.03/1.72  
% 3.03/1.72  #Partial instantiations: 0
% 3.03/1.72  #Strategies tried      : 1
% 3.03/1.72  
% 3.03/1.72  Timing (in seconds)
% 3.03/1.72  ----------------------
% 3.03/1.73  Preprocessing        : 0.47
% 3.03/1.73  Parsing              : 0.28
% 3.03/1.73  CNF conversion       : 0.03
% 3.03/1.73  Main loop            : 0.17
% 3.03/1.73  Inferencing          : 0.08
% 3.03/1.73  Reduction            : 0.04
% 3.03/1.73  Demodulation         : 0.03
% 3.03/1.73  BG Simplification    : 0.01
% 3.03/1.73  Subsumption          : 0.04
% 3.03/1.73  Abstraction          : 0.01
% 3.03/1.73  MUC search           : 0.00
% 3.03/1.73  Cooper               : 0.00
% 3.03/1.73  Total                : 0.69
% 3.03/1.73  Index Insertion      : 0.00
% 3.03/1.73  Index Deletion       : 0.00
% 3.03/1.73  Index Matching       : 0.00
% 3.03/1.73  BG Taut test         : 0.00
%------------------------------------------------------------------------------