TSTP Solution File: SYO889_16 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO889_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/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 : n019.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 3.53s 1.90s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYO889_16 : 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.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 16:02:31 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.53/1.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.53/1.91
% 3.53/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.53/1.92 %$ b > a > #nlpp > #skF_1 > #skF_4 > #skF_3 > #skF_2
% 3.53/1.92
% 3.53/1.92 %Foreground sorts:
% 3.53/1.92 tff($ki_world, type, $ki_world: $tType ).
% 3.53/1.92
% 3.53/1.92 %Background operators:
% 3.53/1.92
% 3.53/1.92
% 3.53/1.92 %Foreground operators:
% 3.53/1.92 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 3.53/1.92 tff('#skF_4', type, '#skF_4': ($ki_world * $i) > $ki_world).
% 3.53/1.92 tff(a, type, a: ($ki_world * $i) > $o).
% 3.53/1.92 tff('#skF_3', type, '#skF_3': $i).
% 3.53/1.92 tff(b, type, b: ($ki_world * $i) > $o).
% 3.53/1.92 tff('#skF_2', type, '#skF_2': $ki_world).
% 3.53/1.92
% 3.53/1.93 tff(f_80, negated_conjecture, ~(((?[W:$ki_world]: ($ki_accessible($ki_local_world, W) & (?[X]: ($ki_exists_in_world_$i(W, X) & (![W0:$ki_world]: ($ki_accessible(W, W0) => a(W0, X))))))) & (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (![X]: ($ki_exists_in_world_$i(W, X) => (?[W0:$ki_world]: ($ki_accessible(W, W0) & b(W0, X)))))))) => (?[W:$ki_world]: ($ki_accessible($ki_local_world, W) & (?[X]: ($ki_exists_in_world_$i(W, X) & (?[W0:$ki_world]: (($ki_accessible(W, W0) & a(W0, X)) & b(W0, X)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', verify)).
% 3.53/1.93 tff(c_16, plain, ($ki_accessible($ki_local_world, '#skF_2')), inference(cnfTransformation, [status(thm)], [f_80])).
% 3.53/1.93 tff(c_14, plain, ($ki_exists_in_world_$i('#skF_2', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_80])).
% 3.53/1.93 tff(c_20, plain, (![W_15:$ki_world, X_19]: ($ki_accessible(W_15, '#skF_4'(W_15, X_19)) | ~$ki_exists_in_world_$i(W_15, X_19) | ~$ki_accessible($ki_local_world, W_15))), inference(cnfTransformation, [status(thm)], [f_80])).
% 3.53/1.93 tff(c_12, plain, (![W0_14:$ki_world]: (a(W0_14, '#skF_3') | ~$ki_accessible('#skF_2', W0_14))), inference(cnfTransformation, [status(thm)], [f_80])).
% 3.53/1.93 tff(c_18, plain, (![W_15:$ki_world, X_19]: (b('#skF_4'(W_15, X_19), X_19) | ~$ki_exists_in_world_$i(W_15, X_19) | ~$ki_accessible($ki_local_world, W_15))), inference(cnfTransformation, [status(thm)], [f_80])).
% 3.53/1.93 tff(c_67, plain, (![W0_49:$ki_world, X_50, W_51:$ki_world]: (~b(W0_49, X_50) | ~a(W0_49, X_50) | ~$ki_accessible(W_51, W0_49) | ~$ki_exists_in_world_$i(W_51, X_50) | ~$ki_accessible($ki_local_world, W_51))), inference(cnfTransformation, [status(thm)], [f_80])).
% 3.53/1.93 tff(c_71, plain, (![W_52:$ki_world, X_53, W_54:$ki_world]: (~a('#skF_4'(W_52, X_53), X_53) | ~$ki_accessible(W_54, '#skF_4'(W_52, X_53)) | ~$ki_exists_in_world_$i(W_54, X_53) | ~$ki_accessible($ki_local_world, W_54) | ~$ki_exists_in_world_$i(W_52, X_53) | ~$ki_accessible($ki_local_world, W_52))), inference(resolution, [status(thm)], [c_18, c_67])).
% 3.53/1.93 tff(c_157, plain, (![W_82:$ki_world, W_83:$ki_world]: (~$ki_accessible(W_82, '#skF_4'(W_83, '#skF_3')) | ~$ki_exists_in_world_$i(W_82, '#skF_3') | ~$ki_accessible($ki_local_world, W_82) | ~$ki_exists_in_world_$i(W_83, '#skF_3') | ~$ki_accessible($ki_local_world, W_83) | ~$ki_accessible('#skF_2', '#skF_4'(W_83, '#skF_3')))), inference(resolution, [status(thm)], [c_12, c_71])).
% 3.53/1.93 tff(c_180, plain, (![W_84:$ki_world]: (~$ki_accessible('#skF_2', '#skF_4'(W_84, '#skF_3')) | ~$ki_exists_in_world_$i(W_84, '#skF_3') | ~$ki_accessible($ki_local_world, W_84))), inference(resolution, [status(thm)], [c_20, c_157])).
% 3.53/1.93 tff(c_192, plain, (~$ki_exists_in_world_$i('#skF_2', '#skF_3') | ~$ki_accessible($ki_local_world, '#skF_2')), inference(resolution, [status(thm)], [c_20, c_180])).
% 3.53/1.93 tff(c_198, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_16, c_14, c_192])).
% 3.53/1.93 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.53/1.93
% 3.53/1.93 Inference rules
% 3.53/1.93 ----------------------
% 3.53/1.93 #Ref : 0
% 3.53/1.93 #Sup : 44
% 3.53/1.93 #Fact : 0
% 3.53/1.93 #Define : 0
% 3.53/1.93 #Split : 0
% 3.53/1.93 #Chain : 0
% 3.53/1.93 #Close : 0
% 3.53/1.93
% 3.53/1.93 Ordering : KBO
% 3.53/1.93
% 3.53/1.93 Simplification rules
% 3.53/1.93 ----------------------
% 3.53/1.93 #Subsume : 6
% 3.53/1.93 #Demod : 4
% 3.53/1.93 #Tautology : 3
% 3.53/1.93 #SimpNegUnit : 0
% 3.53/1.93 #BackRed : 0
% 3.53/1.93
% 3.53/1.93 #Partial instantiations: 0
% 3.53/1.93 #Strategies tried : 1
% 3.53/1.93
% 3.53/1.93 Timing (in seconds)
% 3.53/1.93 ----------------------
% 3.53/1.93 Preprocessing : 0.49
% 3.53/1.93 Parsing : 0.29
% 3.53/1.93 CNF conversion : 0.03
% 3.53/1.93 Main loop : 0.37
% 3.53/1.93 Inferencing : 0.15
% 3.53/1.93 Reduction : 0.08
% 3.53/1.93 Demodulation : 0.06
% 3.53/1.94 BG Simplification : 0.02
% 3.53/1.94 Subsumption : 0.10
% 3.53/1.94 Abstraction : 0.01
% 3.53/1.94 MUC search : 0.00
% 3.53/1.94 Cooper : 0.00
% 3.53/1.94 Total : 0.91
% 3.53/1.94 Index Insertion : 0.00
% 3.53/1.94 Index Deletion : 0.00
% 3.53/1.94 Index Matching : 0.00
% 3.53/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------