TSTP Solution File: NLP265_17 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NLP265_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/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 : n009.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 2.87s 1.65s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP265_17 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.13 % 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.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 13:03:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.87/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.87/1.65
% 2.87/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.87/1.67 %$ bigcity > #nlpp > portland > #idx(i_bob) > #idx(i_alice) > #idx(b_bob) > #idx(b_alice) > #skF_5 > #skF_4 > #skF_3 > #skF_6 > #skF_2 > #skF_1
% 2.87/1.67
% 2.87/1.67 %Foreground sorts:
% 2.87/1.67 tff($ki_index, type, $ki_index: $tType ).
% 2.87/1.67 tff($ki_world, type, $ki_world: $tType ).
% 2.87/1.67
% 2.87/1.67 %Background operators:
% 2.87/1.67
% 2.87/1.67
% 2.87/1.67 %Foreground operators:
% 2.87/1.67 tff('#skF_5', type, '#skF_5': $ki_world).
% 2.87/1.67 tff('#idx(b_bob)', type, '#idx(b_bob)': $ki_index).
% 2.87/1.67 tff('#skF_4', type, '#skF_4': $ki_world > $ki_world).
% 2.87/1.67 tff('#skF_3', type, '#skF_3': $ki_world > $ki_world).
% 2.87/1.67 tff('#idx(b_alice)', type, '#idx(b_alice)': $ki_index).
% 2.87/1.67 tff(bigcity, type, bigcity: ($ki_world * $i) > $o).
% 2.87/1.67 tff('#idx(i_alice)', type, '#idx(i_alice)': $ki_index).
% 2.87/1.67 tff('#skF_6', type, '#skF_6': $ki_world).
% 2.87/1.67 tff('#idx(i_bob)', type, '#idx(i_bob)': $ki_index).
% 2.87/1.67 tff('#skF_2', type, '#skF_2': $ki_world > $ki_world).
% 2.87/1.67 tff('#skF_1', type, '#skF_1': $ki_world > $ki_world).
% 2.87/1.67 tff(portland, type, portland: $i).
% 2.87/1.67
% 2.93/1.68 tff(f_30, axiom, (![W:$ki_world, V:$ki_world]: $ki_accessible('#idx(b_alice)', W, V)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_universal_#idx(b_alice))).
% 2.93/1.68 tff(f_82, axiom, (![W:$ki_world]: ($ki_accessible('#idx(b_alice)', $ki_local_world, W) => bigcity(W, portland))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_2)).
% 2.93/1.68 tff(f_32, axiom, (![W:$ki_world, V:$ki_world]: $ki_accessible('#idx(b_bob)', W, V)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_universal_#idx(b_bob))).
% 2.93/1.68 tff(f_90, axiom, (![W:$ki_world]: ($ki_accessible('#idx(b_alice)', $ki_local_world, W) => (![W0:$ki_world]: ($ki_accessible('#idx(b_bob)', W, W0) => ~bigcity(W0, portland))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_3)).
% 2.93/1.68 tff(c_2, plain, (![W_1:$ki_world, V_2:$ki_world]: ($ki_accessible('#idx(b_alice)', W_1, V_2))), inference(cnfTransformation, [status(thm)], [f_30])).
% 2.93/1.68 tff(c_22, plain, (![W_31:$ki_world]: (bigcity(W_31, portland) | ~$ki_accessible('#idx(b_alice)', $ki_local_world, W_31))), inference(cnfTransformation, [status(thm)], [f_82])).
% 2.93/1.68 tff(c_60, plain, (![W_31:$ki_world]: (bigcity(W_31, portland))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_22])).
% 2.93/1.68 tff(c_4, plain, (![W_3:$ki_world, V_4:$ki_world]: ($ki_accessible('#idx(b_bob)', W_3, V_4))), inference(cnfTransformation, [status(thm)], [f_32])).
% 2.93/1.68 tff(c_24, plain, (![W0_34:$ki_world, W_32:$ki_world]: (~bigcity(W0_34, portland) | ~$ki_accessible('#idx(b_bob)', W_32, W0_34) | ~$ki_accessible('#idx(b_alice)', $ki_local_world, W_32))), inference(cnfTransformation, [status(thm)], [f_90])).
% 2.93/1.68 tff(c_48, plain, (![W0_34:$ki_world, W_32:$ki_world]: (~bigcity(W0_34, portland) | ~$ki_accessible('#idx(b_alice)', $ki_local_world, W_32))), inference(demodulation, [status(thm), theory('equality')], [c_4, c_24])).
% 2.93/1.68 tff(c_62, plain, (![W0_34:$ki_world]: (~bigcity(W0_34, portland))), inference(demodulation, [status(thm), theory('equality')], [c_2, c_48])).
% 2.93/1.68 tff(c_70, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_60, c_62])).
% 2.93/1.68 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.93/1.68
% 2.93/1.68 Inference rules
% 2.93/1.68 ----------------------
% 2.93/1.68 #Ref : 0
% 2.93/1.68 #Sup : 0
% 2.93/1.68 #Fact : 0
% 2.93/1.68 #Define : 0
% 2.93/1.68 #Split : 0
% 2.93/1.68 #Chain : 0
% 2.93/1.68 #Close : 0
% 2.93/1.68
% 2.93/1.68 Ordering : KBO
% 2.93/1.68
% 2.93/1.68 Simplification rules
% 2.93/1.68 ----------------------
% 2.93/1.68 #Subsume : 9
% 2.93/1.68 #Demod : 24
% 2.93/1.68 #Tautology : 5
% 2.93/1.68 #SimpNegUnit : 0
% 2.93/1.68 #BackRed : 0
% 2.93/1.68
% 2.93/1.68 #Partial instantiations: 0
% 2.93/1.68 #Strategies tried : 1
% 2.93/1.68
% 2.93/1.68 Timing (in seconds)
% 2.93/1.68 ----------------------
% 2.93/1.69 Preprocessing : 0.50
% 2.93/1.69 Parsing : 0.30
% 2.93/1.69 CNF conversion : 0.03
% 2.93/1.69 Main loop : 0.12
% 2.93/1.69 Inferencing : 0.00
% 2.93/1.69 Reduction : 0.05
% 2.93/1.69 Demodulation : 0.04
% 2.93/1.69 BG Simplification : 0.02
% 2.93/1.69 Subsumption : 0.05
% 2.93/1.69 Abstraction : 0.01
% 2.93/1.69 MUC search : 0.00
% 2.93/1.69 Cooper : 0.00
% 2.93/1.69 Total : 0.67
% 2.93/1.69 Index Insertion : 0.00
% 2.93/1.69 Index Deletion : 0.00
% 2.93/1.69 Index Matching : 0.00
% 2.93/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------