TSTP Solution File: PLA054_4 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PLA054_4 : 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 : n031.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 10:53:42 EDT 2023

% Result   : Theorem 3.78s 1.98s
% Output   : CNFRefutation 3.78s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14  % Problem  : PLA054_4 : TPTP v8.2.0. Released v8.2.0.
% 0.14/0.15  % 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.15/0.36  % Computer : n031.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 18:45:00 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 3.78/1.98  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.78/1.98  
% 3.78/1.98  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.78/2.00  %$ combo > open > h > closed > #nlpp > o > n > d > #skF_1 > #skF_5 > #skF_3 > #skF_4 > #skF_2
% 3.78/2.00  
% 3.78/2.00  %Foreground sorts:
% 3.78/2.00  tff($ki_world, type, $ki_world: $tType ).
% 3.78/2.00  
% 3.78/2.00  %Background operators:
% 3.78/2.00  
% 3.78/2.00  
% 3.78/2.00  %Foreground operators:
% 3.78/2.00  tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 3.78/2.00  tff('#skF_5', type, '#skF_5': ($i * $i) > $ki_world).
% 3.78/2.00  tff(h, type, h: ($ki_world * $i) > $o).
% 3.78/2.00  tff(combo, type, combo: ($ki_world * $i * $i) > $o).
% 3.78/2.00  tff('#skF_3', type, '#skF_3': $i).
% 3.78/2.00  tff(n, type, n: $i).
% 3.78/2.00  tff(d, type, d: $i).
% 3.78/2.00  tff(open, type, open: ($ki_world * $i) > $o).
% 3.78/2.00  tff(closed, type, closed: ($ki_world * $i) > $o).
% 3.78/2.00  tff('#skF_4', type, '#skF_4': $ki_world).
% 3.78/2.00  tff(o, type, o: $i).
% 3.78/2.00  tff('#skF_2', type, '#skF_2': ($ki_world * $i * $i) > $i).
% 3.78/2.00  
% 3.78/2.02  tff(f_30, axiom, (![W:$ki_world]: $ki_accessible(W, W)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_reflexive)).
% 3.78/2.02  tff(f_130, negated_conjecture, ~(![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[V]: ($ki_exists_in_world_$i(W, V) & (?[O]: ($ki_exists_in_world_$i(W, O) & ((![W0:$ki_world]: ($ki_accessible(W, W0) => (combo(W0, d, V) & h(W0, O)))) => (![W0:$ki_world]: ($ki_accessible(W, W0) => open(W0, d)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', verify)).
% 3.78/2.02  tff(f_38, axiom, (![W:$ki_world, X]: $ki_exists_in_world_$i(W, X)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', $ki_exists_in_world_$i_const)).
% 3.78/2.02  tff(f_36, axiom, (![W:$ki_world, V:$ki_world, U:$ki_world]: (($ki_accessible(W, V) & $ki_accessible(V, U)) => $ki_accessible(W, U))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_transitive)).
% 3.78/2.02  tff(f_85, axiom, (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => closed(W, d))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax2)).
% 3.78/2.02  tff(f_81, axiom, (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (![S]: ($ki_exists_in_world_$i(W, S) => (![V]: ($ki_exists_in_world_$i(W, V) => (?[O]: (($ki_exists_in_world_$i(W, O) & (![W0:$ki_world]: ($ki_accessible(W, W0) => (((closed(W0, S) & combo(W0, S, V)) & h(W0, O)) => (![W1:$ki_world]: ($ki_accessible(W0, W1) => open(W1, S))))))) & (![W0:$ki_world]: ($ki_accessible(W, W0) => (((closed(W0, S) & ~combo(W0, S, V)) & h(W0, o)) => (![W1:$ki_world]: ($ki_accessible(W0, W1) => closed(W1, S)))))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax1)).
% 3.78/2.02  tff(c_2, plain, (![W_1:$ki_world]: ($ki_accessible(W_1, W_1))), inference(cnfTransformation, [status(thm)], [f_30])).
% 3.78/2.02  tff(c_26, plain, ($ki_accessible($ki_local_world, '#skF_4')), inference(cnfTransformation, [status(thm)], [f_130])).
% 3.78/2.02  tff(c_6, plain, (![W_5:$ki_world, X_6]: ($ki_exists_in_world_$i(W_5, X_6))), inference(cnfTransformation, [status(thm)], [f_38])).
% 3.78/2.02  tff(c_30, plain, (![V_137, O_143]: ($ki_accessible('#skF_4', '#skF_5'(V_137, O_143)) | ~$ki_exists_in_world_$i('#skF_4', O_143) | ~$ki_exists_in_world_$i('#skF_4', V_137))), inference(cnfTransformation, [status(thm)], [f_130])).
% 3.78/2.02  tff(c_37, plain, (![V_137, O_143]: ($ki_accessible('#skF_4', '#skF_5'(V_137, O_143)))), inference(demodulation, [status(thm), theory('equality')], [c_6, c_6, c_30])).
% 3.78/2.02  tff(c_61, plain, (![W_160:$ki_world, U_161:$ki_world, V_162:$ki_world]: ($ki_accessible(W_160, U_161) | ~$ki_accessible(V_162, U_161) | ~$ki_accessible(W_160, V_162))), inference(cnfTransformation, [status(thm)], [f_36])).
% 3.78/2.02  tff(c_78, plain, (![W_164:$ki_world, V_165, O_166]: ($ki_accessible(W_164, '#skF_5'(V_165, O_166)) | ~$ki_accessible(W_164, '#skF_4'))), inference(resolution, [status(thm)], [c_37, c_61])).
% 3.78/2.02  tff(c_4, plain, (![W_2:$ki_world, U_4:$ki_world, V_3:$ki_world]: ($ki_accessible(W_2, U_4) | ~$ki_accessible(V_3, U_4) | ~$ki_accessible(W_2, V_3))), inference(cnfTransformation, [status(thm)], [f_36])).
% 3.78/2.02  tff(c_83, plain, (![W_169:$ki_world, V_170, O_171, W_172:$ki_world]: ($ki_accessible(W_169, '#skF_5'(V_170, O_171)) | ~$ki_accessible(W_169, W_172) | ~$ki_accessible(W_172, '#skF_4'))), inference(resolution, [status(thm)], [c_78, c_4])).
% 3.78/2.02  tff(c_91, plain, (![V_170, O_171]: ($ki_accessible($ki_local_world, '#skF_5'(V_170, O_171)) | ~$ki_accessible('#skF_4', '#skF_4'))), inference(resolution, [status(thm)], [c_26, c_83])).
% 3.78/2.02  tff(c_98, plain, (![V_170, O_171]: ($ki_accessible($ki_local_world, '#skF_5'(V_170, O_171)))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_91])).
% 3.78/2.02  tff(c_16, plain, (![W_119:$ki_world]: (closed(W_119, d) | ~$ki_accessible($ki_local_world, W_119))), inference(cnfTransformation, [status(thm)], [f_85])).
% 3.78/2.02  tff(c_28, plain, (![V_137, O_143]: (~open('#skF_5'(V_137, O_143), d) | ~$ki_exists_in_world_$i('#skF_4', O_143) | ~$ki_exists_in_world_$i('#skF_4', V_137))), inference(cnfTransformation, [status(thm)], [f_130])).
% 3.78/2.02  tff(c_39, plain, (![V_137, O_143]: (~open('#skF_5'(V_137, O_143), d))), inference(demodulation, [status(thm), theory('equality')], [c_6, c_6, c_28])).
% 3.78/2.02  tff(c_34, plain, (![W0_146:$ki_world, V_137, O_143]: (combo(W0_146, d, V_137) | ~$ki_accessible('#skF_4', W0_146) | ~$ki_exists_in_world_$i('#skF_4', O_143) | ~$ki_exists_in_world_$i('#skF_4', V_137))), inference(cnfTransformation, [status(thm)], [f_130])).
% 3.78/2.02  tff(c_42, plain, (![W0_146:$ki_world, V_137]: (combo(W0_146, d, V_137) | ~$ki_accessible('#skF_4', W0_146))), inference(demodulation, [status(thm), theory('equality')], [c_6, c_6, c_34])).
% 3.78/2.02  tff(c_32, plain, (![W0_146:$ki_world, O_143, V_137]: (h(W0_146, O_143) | ~$ki_accessible('#skF_4', W0_146) | ~$ki_exists_in_world_$i('#skF_4', O_143) | ~$ki_exists_in_world_$i('#skF_4', V_137))), inference(cnfTransformation, [status(thm)], [f_130])).
% 3.78/2.02  tff(c_52, plain, (![W0_146:$ki_world, O_143]: (h(W0_146, O_143) | ~$ki_accessible('#skF_4', W0_146))), inference(demodulation, [status(thm), theory('equality')], [c_6, c_6, c_32])).
% 3.78/2.02  tff(c_12, plain, (![V_93, W1_115:$ki_world, W_9:$ki_world, S_65, W0_113:$ki_world]: (open(W1_115, S_65) | ~$ki_accessible(W0_113, W1_115) | ~h(W0_113, '#skF_2'(W_9, S_65, V_93)) | ~combo(W0_113, S_65, V_93) | ~closed(W0_113, S_65) | ~$ki_accessible(W_9, W0_113) | ~$ki_exists_in_world_$i(W_9, V_93) | ~$ki_exists_in_world_$i(W_9, S_65) | ~$ki_accessible($ki_local_world, W_9))), inference(cnfTransformation, [status(thm)], [f_81])).
% 3.78/2.02  tff(c_254, plain, (![V_219, W_222:$ki_world, W1_223:$ki_world, W0_220:$ki_world, S_221]: (open(W1_223, S_221) | ~$ki_accessible(W0_220, W1_223) | ~h(W0_220, '#skF_2'(W_222, S_221, V_219)) | ~combo(W0_220, S_221, V_219) | ~closed(W0_220, S_221) | ~$ki_accessible(W_222, W0_220) | ~$ki_accessible($ki_local_world, W_222))), inference(demodulation, [status(thm), theory('equality')], [c_6, c_6, c_12])).
% 3.78/2.02  tff(c_273, plain, (![W_224:$ki_world, S_225, W_226:$ki_world, V_227]: (open(W_224, S_225) | ~h(W_224, '#skF_2'(W_226, S_225, V_227)) | ~combo(W_224, S_225, V_227) | ~closed(W_224, S_225) | ~$ki_accessible(W_226, W_224) | ~$ki_accessible($ki_local_world, W_226))), inference(resolution, [status(thm)], [c_2, c_254])).
% 3.78/2.02  tff(c_284, plain, (![W0_231:$ki_world, S_232, V_233, W_234:$ki_world]: (open(W0_231, S_232) | ~combo(W0_231, S_232, V_233) | ~closed(W0_231, S_232) | ~$ki_accessible(W_234, W0_231) | ~$ki_accessible($ki_local_world, W_234) | ~$ki_accessible('#skF_4', W0_231))), inference(resolution, [status(thm)], [c_52, c_273])).
% 3.78/2.02  tff(c_302, plain, (![W0_235:$ki_world, W_236:$ki_world]: (open(W0_235, d) | ~closed(W0_235, d) | ~$ki_accessible(W_236, W0_235) | ~$ki_accessible($ki_local_world, W_236) | ~$ki_accessible('#skF_4', W0_235))), inference(resolution, [status(thm)], [c_42, c_284])).
% 3.78/2.02  tff(c_306, plain, (![V_170, O_171]: (open('#skF_5'(V_170, O_171), d) | ~closed('#skF_5'(V_170, O_171), d) | ~$ki_accessible($ki_local_world, $ki_local_world) | ~$ki_accessible('#skF_4', '#skF_5'(V_170, O_171)))), inference(resolution, [status(thm)], [c_98, c_302])).
% 3.78/2.02  tff(c_321, plain, (![V_170, O_171]: (open('#skF_5'(V_170, O_171), d) | ~closed('#skF_5'(V_170, O_171), d))), inference(demodulation, [status(thm), theory('equality')], [c_37, c_2, c_306])).
% 3.78/2.02  tff(c_335, plain, (![V_237, O_238]: (~closed('#skF_5'(V_237, O_238), d))), inference(negUnitSimplification, [status(thm)], [c_39, c_321])).
% 3.78/2.02  tff(c_350, plain, (![V_237, O_238]: (~$ki_accessible($ki_local_world, '#skF_5'(V_237, O_238)))), inference(resolution, [status(thm)], [c_16, c_335])).
% 3.78/2.02  tff(c_357, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_98, c_350])).
% 3.78/2.02  % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.78/2.02  
% 3.78/2.02  Inference rules
% 3.78/2.02  ----------------------
% 3.78/2.02  #Ref     : 0
% 3.78/2.02  #Sup     : 70
% 3.78/2.02  #Fact    : 0
% 3.78/2.02  #Define  : 0
% 3.78/2.02  #Split   : 3
% 3.78/2.02  #Chain   : 0
% 3.78/2.02  #Close   : 0
% 3.78/2.02  
% 3.78/2.02  Ordering : KBO
% 3.78/2.02  
% 3.78/2.02  Simplification rules
% 3.78/2.02  ----------------------
% 3.78/2.02  #Subsume      : 10
% 3.78/2.02  #Demod        : 46
% 3.78/2.02  #Tautology    : 12
% 3.78/2.02  #SimpNegUnit  : 4
% 3.78/2.02  #BackRed      : 0
% 3.78/2.02  
% 3.78/2.02  #Partial instantiations: 0
% 3.78/2.02  #Strategies tried      : 1
% 3.78/2.02  
% 3.78/2.02  Timing (in seconds)
% 3.78/2.02  ----------------------
% 3.78/2.02  Preprocessing        : 0.54
% 3.78/2.02  Parsing              : 0.32
% 3.78/2.02  CNF conversion       : 0.05
% 3.78/2.02  Main loop            : 0.39
% 3.78/2.02  Inferencing          : 0.15
% 3.78/2.02  Reduction            : 0.10
% 3.78/2.02  Demodulation         : 0.07
% 3.78/2.02  BG Simplification    : 0.02
% 3.78/2.02  Subsumption          : 0.10
% 3.78/2.02  Abstraction          : 0.01
% 3.78/2.02  MUC search           : 0.00
% 3.78/2.02  Cooper               : 0.00
% 3.78/2.02  Total                : 0.98
% 3.78/2.02  Index Insertion      : 0.00
% 3.78/2.02  Index Deletion       : 0.00
% 3.78/2.02  Index Matching       : 0.00
% 3.78/2.02  BG Taut test         : 0.00
%------------------------------------------------------------------------------