TSTP Solution File: NLP267_17 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NLP267_17 : 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 : n025.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:48 EDT 2023
% Result : Theorem 2.91s 1.69s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NLP267_17 : TPTP v8.2.0. Released v8.2.0.
% 0.00/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.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:13:04 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.91/1.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.91/1.69
% 2.91/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.91/1.71 %$ price > dest > class > #nlpp > seventy > second > paris > ninetyfive > first > #idx(b_u) > #idx(b_s) > #skF_1
% 2.91/1.71
% 2.91/1.71 %Foreground sorts:
% 2.91/1.71 tff($ki_index, type, $ki_index: $tType ).
% 2.91/1.71 tff($ki_world, type, $ki_world: $tType ).
% 2.91/1.71
% 2.91/1.71 %Background operators:
% 2.91/1.71
% 2.91/1.71
% 2.91/1.71 %Foreground operators:
% 2.91/1.71 tff(dest, type, dest: ($ki_world * $i) > $o).
% 2.91/1.71 tff(second, type, second: $i).
% 2.91/1.71 tff(paris, type, paris: $i).
% 2.91/1.71 tff(first, type, first: $i).
% 2.91/1.71 tff('#idx(b_s)', type, '#idx(b_s)': $ki_index).
% 2.91/1.71 tff(seventy, type, seventy: $i).
% 2.91/1.71 tff(ninetyfive, type, ninetyfive: $i).
% 2.91/1.71 tff(price, type, price: ($ki_world * $i) > $o).
% 2.91/1.71 tff(class, type, class: ($ki_world * $i) > $o).
% 2.91/1.71 tff('#skF_1', type, '#skF_1': $ki_world).
% 2.91/1.71 tff('#idx(b_u)', type, '#idx(b_u)': $ki_index).
% 2.91/1.71
% 2.91/1.73 tff(f_30, axiom, (![W:$ki_world, V:$ki_world]: $ki_accessible('#idx(b_s)', W, V)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mrel_universal_#idx(b_s))).
% 2.91/1.73 tff(f_82, axiom, (![W:$ki_world]: ($ki_accessible('#idx(b_s)', $ki_local_world, W) => (dest(W, paris) & class(W, second)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_5)).
% 2.91/1.73 tff(f_48, axiom, (![W:$ki_world]: ($ki_accessible('#idx(b_s)', $ki_local_world, W) => ((dest(W, paris) & class(W, second)) => price(W, seventy)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_2)).
% 2.91/1.73 tff(f_87, negated_conjecture, ~(![W:$ki_world]: ($ki_accessible('#idx(b_s)', $ki_local_world, W) => price(W, seventy))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', verify)).
% 2.91/1.73 tff(c_2, plain, (![W_1:$ki_world, V_2:$ki_world]: ($ki_accessible('#idx(b_s)', W_1, V_2))), inference(cnfTransformation, [status(thm)], [f_30])).
% 2.91/1.73 tff(c_18, plain, (![W_11:$ki_world]: (class(W_11, second) | ~$ki_accessible('#idx(b_s)', $ki_local_world, W_11))), inference(cnfTransformation, [status(thm)], [f_82])).
% 2.91/1.73 tff(c_37, plain, (![W_11:$ki_world]: (class(W_11, second))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_18])).
% 2.91/1.73 tff(c_20, plain, (![W_11:$ki_world]: (dest(W_11, paris) | ~$ki_accessible('#idx(b_s)', $ki_local_world, W_11))), inference(cnfTransformation, [status(thm)], [f_82])).
% 2.91/1.73 tff(c_31, plain, (![W_11:$ki_world]: (dest(W_11, paris))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_20])).
% 2.91/1.73 tff(c_8, plain, (![W_6:$ki_world]: (price(W_6, seventy) | ~class(W_6, second) | ~dest(W_6, paris) | ~$ki_accessible('#idx(b_s)', $ki_local_world, W_6))), inference(cnfTransformation, [status(thm)], [f_48])).
% 2.91/1.73 tff(c_33, plain, (![W_6:$ki_world]: (price(W_6, seventy) | ~class(W_6, second) | ~dest(W_6, paris))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_8])).
% 2.91/1.73 tff(c_39, plain, (![W_6:$ki_world]: (price(W_6, seventy) | ~class(W_6, second))), inference(demodulation, [status(thm), theory('equality')], [c_31, c_33])).
% 2.91/1.73 tff(c_45, plain, (![W_6:$ki_world]: (price(W_6, seventy))), inference(demodulation, [status(thm), theory('equality')], [c_37, c_39])).
% 2.91/1.73 tff(c_22, plain, (~price('#skF_1', seventy)), inference(cnfTransformation, [status(thm)], [f_87])).
% 2.91/1.73 tff(c_47, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_45, c_22])).
% 2.91/1.73 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.91/1.73
% 2.91/1.73 Inference rules
% 2.91/1.73 ----------------------
% 2.91/1.73 #Ref : 0
% 2.91/1.73 #Sup : 0
% 2.91/1.73 #Fact : 0
% 2.91/1.73 #Define : 0
% 2.91/1.73 #Split : 0
% 2.91/1.73 #Chain : 0
% 2.91/1.73 #Close : 0
% 2.91/1.73
% 2.91/1.73 Ordering : KBO
% 2.91/1.73
% 2.91/1.73 Simplification rules
% 2.91/1.73 ----------------------
% 2.91/1.73 #Subsume : 10
% 2.91/1.73 #Demod : 13
% 2.91/1.73 #Tautology : 1
% 2.91/1.73 #SimpNegUnit : 0
% 2.91/1.73 #BackRed : 0
% 2.91/1.73
% 2.91/1.73 #Partial instantiations: 0
% 2.91/1.73 #Strategies tried : 1
% 2.91/1.73
% 2.91/1.73 Timing (in seconds)
% 2.91/1.73 ----------------------
% 2.91/1.73 Preprocessing : 0.50
% 2.91/1.73 Parsing : 0.31
% 2.91/1.73 CNF conversion : 0.03
% 2.91/1.73 Main loop : 0.08
% 2.91/1.73 Inferencing : 0.00
% 2.91/1.73 Reduction : 0.04
% 2.91/1.73 Demodulation : 0.03
% 2.91/1.73 BG Simplification : 0.02
% 2.91/1.73 Subsumption : 0.04
% 2.91/1.73 Abstraction : 0.01
% 2.91/1.73 MUC search : 0.00
% 2.91/1.73 Cooper : 0.00
% 2.91/1.73 Total : 0.64
% 2.91/1.73 Index Insertion : 0.00
% 2.91/1.73 Index Deletion : 0.00
% 2.91/1.73 Index Matching : 0.00
% 2.91/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------