TSTP Solution File: SYO891_16 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYO891_16 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n003.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.91s 1.65s
% Output   : CNFRefutation 3.01s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYO891_16 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35  % Computer : n003.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:08:08 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.91/1.65  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.66  
% 2.91/1.66  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.01/1.67  %$ qmltpeq > p > #nlpp > #skF_1 > #skF_3 > #skF_2 > #skF_4
% 3.01/1.67  
% 3.01/1.67  %Foreground sorts:
% 3.01/1.67  tff($ki_world, type, $ki_world: $tType ).
% 3.01/1.67  
% 3.01/1.67  %Background operators:
% 3.01/1.67  
% 3.01/1.67  
% 3.01/1.67  %Foreground operators:
% 3.01/1.67  tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 3.01/1.67  tff(p, type, p: ($ki_world * $i) > $o).
% 3.01/1.67  tff('#skF_3', type, '#skF_3': $i).
% 3.01/1.67  tff(qmltpeq, type, qmltpeq: ($ki_world * $i * $i) > $o).
% 3.01/1.67  tff('#skF_2', type, '#skF_2': ($i * $ki_world) > $i).
% 3.01/1.67  tff('#skF_4', type, '#skF_4': $ki_world).
% 3.01/1.67  
% 3.01/1.68  tff(f_110, negated_conjecture, ~((![X]: ($ki_exists_in_world_$i($ki_local_world, X) => (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[Y]: ($ki_exists_in_world_$i(W, Y) & qmltpeq(W, X, Y))))))) => ((?[X]: ($ki_exists_in_world_$i($ki_local_world, X) & (?[W:$ki_world]: ($ki_accessible($ki_local_world, W) & p(W, X))))) => (?[W:$ki_world]: ($ki_accessible($ki_local_world, W) & (?[X]: ($ki_exists_in_world_$i(W, X) & p(W, X))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', verify)).
% 3.01/1.68  tff(f_42, axiom, (![W:$ki_world, V:$ki_world, X]: (($ki_exists_in_world_$i(W, X) & $ki_accessible(W, V)) => $ki_exists_in_world_$i(V, X))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', $ki_exists_in_world_$i_cumul)).
% 3.01/1.68  tff(c_22, plain, ($ki_accessible($ki_local_world, '#skF_4')), inference(cnfTransformation, [status(thm)], [f_110])).
% 3.01/1.68  tff(c_20, plain, (p('#skF_4', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_110])).
% 3.01/1.68  tff(c_46, plain, (![W_41:$ki_world, X_42]: (~p(W_41, X_42) | ~$ki_exists_in_world_$i(W_41, X_42) | ~$ki_accessible($ki_local_world, W_41))), inference(cnfTransformation, [status(thm)], [f_110])).
% 3.01/1.68  tff(c_49, plain, (~$ki_exists_in_world_$i('#skF_4', '#skF_3') | ~$ki_accessible($ki_local_world, '#skF_4')), inference(resolution, [status(thm)], [c_20, c_46])).
% 3.01/1.68  tff(c_52, plain, (~$ki_exists_in_world_$i('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_22, c_49])).
% 3.01/1.68  tff(c_24, plain, ($ki_exists_in_world_$i($ki_local_world, '#skF_3')), inference(cnfTransformation, [status(thm)], [f_110])).
% 3.01/1.68  tff(c_54, plain, (![V_45:$ki_world, X_46, W_47:$ki_world]: ($ki_exists_in_world_$i(V_45, X_46) | ~$ki_accessible(W_47, V_45) | ~$ki_exists_in_world_$i(W_47, X_46))), inference(cnfTransformation, [status(thm)], [f_42])).
% 3.01/1.68  tff(c_61, plain, (![X_48]: ($ki_exists_in_world_$i('#skF_4', X_48) | ~$ki_exists_in_world_$i($ki_local_world, X_48))), inference(resolution, [status(thm)], [c_22, c_54])).
% 3.01/1.68  tff(c_72, plain, ($ki_exists_in_world_$i('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_24, c_61])).
% 3.01/1.68  tff(c_80, plain, $false, inference(negUnitSimplification, [status(thm)], [c_52, c_72])).
% 3.01/1.68  % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.01/1.68  
% 3.01/1.68  Inference rules
% 3.01/1.68  ----------------------
% 3.01/1.68  #Ref     : 0
% 3.01/1.68  #Sup     : 9
% 3.01/1.68  #Fact    : 0
% 3.01/1.68  #Define  : 0
% 3.01/1.68  #Split   : 0
% 3.01/1.68  #Chain   : 0
% 3.01/1.68  #Close   : 0
% 3.01/1.68  
% 3.01/1.68  Ordering : KBO
% 3.01/1.68  
% 3.01/1.68  Simplification rules
% 3.01/1.68  ----------------------
% 3.01/1.68  #Subsume      : 0
% 3.01/1.68  #Demod        : 3
% 3.01/1.68  #Tautology    : 3
% 3.01/1.68  #SimpNegUnit  : 1
% 3.01/1.68  #BackRed      : 0
% 3.01/1.68  
% 3.01/1.68  #Partial instantiations: 0
% 3.01/1.68  #Strategies tried      : 1
% 3.01/1.68  
% 3.01/1.68  Timing (in seconds)
% 3.01/1.68  ----------------------
% 3.01/1.68  Preprocessing        : 0.47
% 3.01/1.68  Parsing              : 0.28
% 3.01/1.68  CNF conversion       : 0.03
% 3.01/1.68  Main loop            : 0.17
% 3.01/1.68  Inferencing          : 0.07
% 3.01/1.68  Reduction            : 0.04
% 3.01/1.68  Demodulation         : 0.03
% 3.01/1.68  BG Simplification    : 0.02
% 3.01/1.68  Subsumption          : 0.04
% 3.01/1.68  Abstraction          : 0.01
% 3.01/1.68  MUC search           : 0.00
% 3.01/1.68  Cooper               : 0.00
% 3.01/1.68  Total                : 0.68
% 3.01/1.68  Index Insertion      : 0.00
% 3.01/1.68  Index Deletion       : 0.00
% 3.01/1.68  Index Matching       : 0.00
% 3.01/1.68  BG Taut test         : 0.00
%------------------------------------------------------------------------------