TSTP Solution File: NLP266_23 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NLP266_23 : 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 : n020.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:50:47 EDT 2023
% Result : Theorem 3.29s 1.79s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NLP266_23 : TPTP v8.2.0. Released v8.2.0.
% 0.00/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 : n020.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 13:03:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.29/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.29/1.80
% 3.29/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.38/1.81 %$ in > do > userid > number > string > entry_box > #nlpp > u > one > #skF_7 > #skF_5 > #skF_1 > #skF_4 > #skF_8 > #skF_6 > #skF_2 > #skF_3
% 3.38/1.81
% 3.38/1.81 %Foreground sorts:
% 3.38/1.81 tff($ki_world, type, $ki_world: $tType ).
% 3.38/1.81
% 3.38/1.81 %Background operators:
% 3.38/1.81
% 3.38/1.81
% 3.38/1.81 %Foreground operators:
% 3.38/1.81 tff('#skF_7', type, '#skF_7': ($i * $i * $i * $i) > $ki_world).
% 3.38/1.81 tff(entry_box, type, entry_box: ($ki_world * $i) > $o).
% 3.38/1.81 tff('#skF_5', type, '#skF_5': $ki_world).
% 3.38/1.81 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 3.38/1.81 tff(string, type, string: ($ki_world * $i) > $o).
% 3.38/1.81 tff('#skF_4', type, '#skF_4': ($ki_world * $i * $i * $i) > $i).
% 3.38/1.81 tff(u, type, u: $i).
% 3.38/1.81 tff(in, type, in: ($ki_world * $i * $i * $i) > $o).
% 3.38/1.81 tff('#skF_8', type, '#skF_8': ($i * $i * $i * $i) > $i).
% 3.38/1.81 tff('#skF_6', type, '#skF_6': ($i * $i * $i * $i) > $ki_world).
% 3.38/1.81 tff('#skF_2', type, '#skF_2': $ki_world > $i).
% 3.38/1.81 tff('#skF_3', type, '#skF_3': $i).
% 3.38/1.81 tff(number, type, number: ($ki_world * $i * $i) > $o).
% 3.38/1.81 tff(one, type, one: $i).
% 3.38/1.81 tff(do, type, do: ($ki_world * $i * $i * $i) > $o).
% 3.38/1.81 tff(userid, type, userid: ($ki_world * $i * $i) > $o).
% 3.38/1.81
% 3.38/1.83 tff(f_30, axiom, (![W:$ki_world, V:$ki_world]: $ki_accessible(W, V)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_universal)).
% 3.38/1.83 tff(f_47, axiom, (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[I]: ($ki_exists_in_world_$i(W, I) & (![W0:$ki_world]: ($ki_accessible(W, W0) => (userid(W0, u, I) & string(W0, I)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax1)).
% 3.38/1.83 tff(f_56, axiom, (?[B]: ($ki_exists_in_world_$i($ki_local_world, B) & (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (entry_box(W, B) & number(W, B, one)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax2)).
% 3.38/1.83 tff(f_32, 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.38/1.83 tff(f_118, negated_conjecture, ~(![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[I]: ($ki_exists_in_world_$i(W, I) & (?[B]: ($ki_exists_in_world_$i(W, B) & (?[A]: ($ki_exists_in_world_$i(W, A) & (?[S]: (($ki_exists_in_world_$i(W, S) & (![W0:$ki_world]: ($ki_accessible(W, W0) => ((userid(W0, u, I) & entry_box(W0, B)) & number(W0, B, one))))) & (![W0:$ki_world]: ($ki_accessible(W, W0) => (![S2]: ($ki_exists_in_world_$i(W0, S2) => (do(W0, S, A, S2) => in(W0, I, B, S2)))))))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', verify)).
% 3.38/1.83 tff(f_84, axiom, (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (![S]: ($ki_exists_in_world_$i(W, S) => (![I]: ($ki_exists_in_world_$i(W, I) => (![B]: ($ki_exists_in_world_$i(W, B) => ((string(W, I) & entry_box(W, B)) => (?[A]: ($ki_exists_in_world_$i(W, A) & (![W0:$ki_world]: ($ki_accessible(W, W0) => (![S2]: ($ki_exists_in_world_$i(W0, S2) => (do(W0, S, A, S2) => in(W0, I, B, S2))))))))))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax3)).
% 3.38/1.83 tff(c_2, plain, (![W_1:$ki_world, V_2:$ki_world]: ($ki_accessible(W_1, V_2))), inference(cnfTransformation, [status(thm)], [f_30])).
% 3.38/1.83 tff(c_10, plain, (![W0_12:$ki_world, W_7:$ki_world]: (string(W0_12, '#skF_2'(W_7)) | ~$ki_accessible(W_7, W0_12) | ~$ki_accessible($ki_local_world, W_7))), inference(cnfTransformation, [status(thm)], [f_47])).
% 3.38/1.83 tff(c_68, plain, (![W0_12:$ki_world, W_7:$ki_world]: (string(W0_12, '#skF_2'(W_7)))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_2, c_10])).
% 3.38/1.83 tff(c_12, plain, (![W0_12:$ki_world, W_7:$ki_world]: (userid(W0_12, u, '#skF_2'(W_7)) | ~$ki_accessible(W_7, W0_12) | ~$ki_accessible($ki_local_world, W_7))), inference(cnfTransformation, [status(thm)], [f_47])).
% 3.38/1.83 tff(c_70, plain, (![W0_12:$ki_world, W_7:$ki_world]: (userid(W0_12, u, '#skF_2'(W_7)))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_2, c_12])).
% 3.38/1.83 tff(c_18, plain, (![W_14:$ki_world]: (entry_box(W_14, '#skF_3') | ~$ki_accessible($ki_local_world, W_14))), inference(cnfTransformation, [status(thm)], [f_56])).
% 3.38/1.83 tff(c_72, plain, (![W_14:$ki_world]: (entry_box(W_14, '#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_18])).
% 3.38/1.83 tff(c_16, plain, (![W_14:$ki_world]: (number(W_14, '#skF_3', one) | ~$ki_accessible($ki_local_world, W_14))), inference(cnfTransformation, [status(thm)], [f_56])).
% 3.38/1.83 tff(c_66, plain, (![W_14:$ki_world]: (number(W_14, '#skF_3', one))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_16])).
% 3.38/1.83 tff(c_4, plain, (![W_3:$ki_world, X_4]: ($ki_exists_in_world_$i(W_3, X_4))), inference(cnfTransformation, [status(thm)], [f_32])).
% 3.38/1.83 tff(c_30, plain, (![I_220, B_260, A_280, S_290]: (~number('#skF_6'(I_220, B_260, A_280, S_290), B_260, one) | ~entry_box('#skF_6'(I_220, B_260, A_280, S_290), B_260) | ~userid('#skF_6'(I_220, B_260, A_280, S_290), u, I_220) | do('#skF_7'(I_220, B_260, A_280, S_290), S_290, A_280, '#skF_8'(I_220, B_260, A_280, S_290)) | ~$ki_exists_in_world_$i('#skF_5', S_290) | ~$ki_exists_in_world_$i('#skF_5', A_280) | ~$ki_exists_in_world_$i('#skF_5', B_260) | ~$ki_exists_in_world_$i('#skF_5', I_220))), inference(cnfTransformation, [status(thm)], [f_118])).
% 3.38/1.83 tff(c_86, plain, (![I_312, B_313, A_314, S_315]: (~number('#skF_6'(I_312, B_313, A_314, S_315), B_313, one) | ~entry_box('#skF_6'(I_312, B_313, A_314, S_315), B_313) | ~userid('#skF_6'(I_312, B_313, A_314, S_315), u, I_312) | do('#skF_7'(I_312, B_313, A_314, S_315), S_315, A_314, '#skF_8'(I_312, B_313, A_314, S_315)))), inference(demodulation, [status(thm), theory('equality')], [c_4, c_4, c_4, c_4, c_30])).
% 3.38/1.83 tff(c_20, plain, (![W_15:$ki_world, I_111, S_79, B_127, W0_138:$ki_world, S2_140]: (in(W0_138, I_111, B_127, S2_140) | ~do(W0_138, S_79, '#skF_4'(W_15, S_79, I_111, B_127), S2_140) | ~$ki_exists_in_world_$i(W0_138, S2_140) | ~$ki_accessible(W_15, W0_138) | ~entry_box(W_15, B_127) | ~string(W_15, I_111) | ~$ki_exists_in_world_$i(W_15, B_127) | ~$ki_exists_in_world_$i(W_15, I_111) | ~$ki_exists_in_world_$i(W_15, S_79) | ~$ki_accessible($ki_local_world, W_15))), inference(cnfTransformation, [status(thm)], [f_84])).
% 3.38/1.83 tff(c_51, plain, (![W_15:$ki_world, I_111, S_79, B_127, W0_138:$ki_world, S2_140]: (in(W0_138, I_111, B_127, S2_140) | ~do(W0_138, S_79, '#skF_4'(W_15, S_79, I_111, B_127), S2_140) | ~$ki_accessible(W_15, W0_138) | ~entry_box(W_15, B_127) | ~string(W_15, I_111) | ~$ki_accessible($ki_local_world, W_15))), inference(demodulation, [status(thm), theory('equality')], [c_4, c_4, c_4, c_4, c_20])).
% 3.38/1.83 tff(c_76, plain, (![W_15:$ki_world, I_111, S_79, B_127, W0_138:$ki_world, S2_140]: (in(W0_138, I_111, B_127, S2_140) | ~do(W0_138, S_79, '#skF_4'(W_15, S_79, I_111, B_127), S2_140) | ~entry_box(W_15, B_127) | ~string(W_15, I_111))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_2, c_51])).
% 3.38/1.83 tff(c_93, plain, (![I_322, W_323:$ki_world, I_321, S_320, B_325, B_324]: (in('#skF_7'(I_322, B_324, '#skF_4'(W_323, S_320, I_321, B_325), S_320), I_321, B_325, '#skF_8'(I_322, B_324, '#skF_4'(W_323, S_320, I_321, B_325), S_320)) | ~entry_box(W_323, B_325) | ~string(W_323, I_321) | ~number('#skF_6'(I_322, B_324, '#skF_4'(W_323, S_320, I_321, B_325), S_320), B_324, one) | ~entry_box('#skF_6'(I_322, B_324, '#skF_4'(W_323, S_320, I_321, B_325), S_320), B_324) | ~userid('#skF_6'(I_322, B_324, '#skF_4'(W_323, S_320, I_321, B_325), S_320), u, I_322))), inference(resolution, [status(thm)], [c_86, c_76])).
% 3.38/1.83 tff(c_26, plain, (![I_220, B_260, A_280, S_290]: (~number('#skF_6'(I_220, B_260, A_280, S_290), B_260, one) | ~entry_box('#skF_6'(I_220, B_260, A_280, S_290), B_260) | ~userid('#skF_6'(I_220, B_260, A_280, S_290), u, I_220) | ~in('#skF_7'(I_220, B_260, A_280, S_290), I_220, B_260, '#skF_8'(I_220, B_260, A_280, S_290)) | ~$ki_exists_in_world_$i('#skF_5', S_290) | ~$ki_exists_in_world_$i('#skF_5', A_280) | ~$ki_exists_in_world_$i('#skF_5', B_260) | ~$ki_exists_in_world_$i('#skF_5', I_220))), inference(cnfTransformation, [status(thm)], [f_118])).
% 3.38/1.83 tff(c_59, plain, (![I_220, B_260, A_280, S_290]: (~number('#skF_6'(I_220, B_260, A_280, S_290), B_260, one) | ~entry_box('#skF_6'(I_220, B_260, A_280, S_290), B_260) | ~userid('#skF_6'(I_220, B_260, A_280, S_290), u, I_220) | ~in('#skF_7'(I_220, B_260, A_280, S_290), I_220, B_260, '#skF_8'(I_220, B_260, A_280, S_290)))), inference(demodulation, [status(thm), theory('equality')], [c_4, c_4, c_4, c_4, c_26])).
% 3.38/1.83 tff(c_99, plain, (![W_326:$ki_world, B_327, I_328, S_329]: (~entry_box(W_326, B_327) | ~string(W_326, I_328) | ~number('#skF_6'(I_328, B_327, '#skF_4'(W_326, S_329, I_328, B_327), S_329), B_327, one) | ~entry_box('#skF_6'(I_328, B_327, '#skF_4'(W_326, S_329, I_328, B_327), S_329), B_327) | ~userid('#skF_6'(I_328, B_327, '#skF_4'(W_326, S_329, I_328, B_327), S_329), u, I_328))), inference(resolution, [status(thm)], [c_93, c_59])).
% 3.38/1.83 tff(c_102, plain, (![W_326:$ki_world, I_328, S_329]: (~entry_box(W_326, '#skF_3') | ~string(W_326, I_328) | ~entry_box('#skF_6'(I_328, '#skF_3', '#skF_4'(W_326, S_329, I_328, '#skF_3'), S_329), '#skF_3') | ~userid('#skF_6'(I_328, '#skF_3', '#skF_4'(W_326, S_329, I_328, '#skF_3'), S_329), u, I_328))), inference(resolution, [status(thm)], [c_66, c_99])).
% 3.38/1.83 tff(c_106, plain, (![W_330:$ki_world, I_331, S_332]: (~string(W_330, I_331) | ~userid('#skF_6'(I_331, '#skF_3', '#skF_4'(W_330, S_332, I_331, '#skF_3'), S_332), u, I_331))), inference(demodulation, [status(thm), theory('equality')], [c_72, c_72, c_102])).
% 3.38/1.83 tff(c_110, plain, (![W_330:$ki_world, W_7:$ki_world]: (~string(W_330, '#skF_2'(W_7)))), inference(resolution, [status(thm)], [c_70, c_106])).
% 3.38/1.83 tff(c_114, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_68, c_110])).
% 3.38/1.83 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.38/1.83
% 3.38/1.83 Inference rules
% 3.38/1.83 ----------------------
% 3.38/1.83 #Ref : 0
% 3.38/1.83 #Sup : 4
% 3.38/1.83 #Fact : 0
% 3.38/1.83 #Define : 0
% 3.38/1.83 #Split : 0
% 3.38/1.83 #Chain : 0
% 3.38/1.83 #Close : 0
% 3.38/1.83
% 3.38/1.83 Ordering : KBO
% 3.38/1.83
% 3.38/1.83 Simplification rules
% 3.38/1.83 ----------------------
% 3.38/1.83 #Subsume : 0
% 3.38/1.83 #Demod : 62
% 3.38/1.83 #Tautology : 11
% 3.38/1.83 #SimpNegUnit : 0
% 3.38/1.83 #BackRed : 0
% 3.38/1.83
% 3.38/1.83 #Partial instantiations: 0
% 3.38/1.83 #Strategies tried : 1
% 3.38/1.83
% 3.38/1.83 Timing (in seconds)
% 3.38/1.83 ----------------------
% 3.38/1.83 Preprocessing : 0.54
% 3.38/1.83 Parsing : 0.31
% 3.38/1.83 CNF conversion : 0.06
% 3.38/1.83 Main loop : 0.22
% 3.38/1.83 Inferencing : 0.08
% 3.38/1.83 Reduction : 0.06
% 3.38/1.83 Demodulation : 0.05
% 3.38/1.83 BG Simplification : 0.02
% 3.38/1.84 Subsumption : 0.05
% 3.38/1.84 Abstraction : 0.01
% 3.38/1.84 MUC search : 0.00
% 3.38/1.84 Cooper : 0.00
% 3.38/1.84 Total : 0.81
% 3.38/1.84 Index Insertion : 0.00
% 3.44/1.84 Index Deletion : 0.00
% 3.44/1.84 Index Matching : 0.00
% 3.44/1.84 BG Taut test : 0.00
%------------------------------------------------------------------------------