TSTP Solution File: SYO890_16 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO890_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/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 : n022.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 2.99s 1.78s
% Output : CNFRefutation 2.99s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYO890_16 : TPTP v8.2.0. Released v8.2.0.
% 0.12/0.14 % 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.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 15:58:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.99/1.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.78
% 2.99/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.79 %$ f > e > #nlpp > #skF_1 > #skF_2 > #skF_3
% 2.99/1.79
% 2.99/1.79 %Foreground sorts:
% 2.99/1.79 tff($ki_world, type, $ki_world: $tType ).
% 2.99/1.79
% 2.99/1.79 %Background operators:
% 2.99/1.79
% 2.99/1.79
% 2.99/1.79 %Foreground operators:
% 2.99/1.79 tff(e, type, e: ($ki_world * $i) > $o).
% 2.99/1.79 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 2.99/1.79 tff(f, type, f: ($ki_world * $i) > $o).
% 2.99/1.79 tff('#skF_2', type, '#skF_2': $i).
% 2.99/1.79 tff('#skF_3', type, '#skF_3': $ki_world).
% 2.99/1.79
% 2.99/1.80 tff(f_63, negated_conjecture, ~((?[X]: ($ki_exists_in_world_$i($ki_local_world, X) & (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (e(W, X) & f(W, X)))))) => (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[X]: ($ki_exists_in_world_$i(W, X) & f(W, X)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', verify)).
% 2.99/1.80 tff(f_42, axiom, (![W:$ki_world, V:$ki_world, X]: (($ki_exists_in_world_$i(W, X) & $ki_accessible(W, V)) => $ki_exists_in_world_$i(V, X))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', $ki_exists_in_world_$i_cumul)).
% 2.99/1.80 tff(c_12, plain, ($ki_accessible($ki_local_world, '#skF_3')), inference(cnfTransformation, [status(thm)], [f_63])).
% 2.99/1.80 tff(c_16, plain, (![W_11:$ki_world]: (f(W_11, '#skF_2') | ~$ki_accessible($ki_local_world, W_11))), inference(cnfTransformation, [status(thm)], [f_63])).
% 2.99/1.80 tff(c_22, plain, (![X_17]: (~f('#skF_3', X_17) | ~$ki_exists_in_world_$i('#skF_3', X_17))), inference(cnfTransformation, [status(thm)], [f_63])).
% 2.99/1.80 tff(c_26, plain, (~$ki_exists_in_world_$i('#skF_3', '#skF_2') | ~$ki_accessible($ki_local_world, '#skF_3')), inference(resolution, [status(thm)], [c_16, c_22])).
% 2.99/1.80 tff(c_29, plain, (~$ki_exists_in_world_$i('#skF_3', '#skF_2')), inference(demodulation, [status(thm), theory('equality')], [c_12, c_26])).
% 2.99/1.80 tff(c_14, plain, ($ki_exists_in_world_$i($ki_local_world, '#skF_2')), inference(cnfTransformation, [status(thm)], [f_63])).
% 2.99/1.80 tff(c_31, plain, (![V_19:$ki_world, X_20, W_21:$ki_world]: ($ki_exists_in_world_$i(V_19, X_20) | ~$ki_accessible(W_21, V_19) | ~$ki_exists_in_world_$i(W_21, X_20))), inference(cnfTransformation, [status(thm)], [f_42])).
% 2.99/1.80 tff(c_38, plain, (![X_22]: ($ki_exists_in_world_$i('#skF_3', X_22) | ~$ki_exists_in_world_$i($ki_local_world, X_22))), inference(resolution, [status(thm)], [c_12, c_31])).
% 2.99/1.80 tff(c_45, plain, ($ki_exists_in_world_$i('#skF_3', '#skF_2')), inference(resolution, [status(thm)], [c_14, c_38])).
% 2.99/1.80 tff(c_50, plain, $false, inference(negUnitSimplification, [status(thm)], [c_29, c_45])).
% 2.99/1.80 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.99/1.80
% 2.99/1.80 Inference rules
% 2.99/1.80 ----------------------
% 2.99/1.80 #Ref : 0
% 2.99/1.80 #Sup : 5
% 2.99/1.80 #Fact : 0
% 2.99/1.80 #Define : 0
% 2.99/1.80 #Split : 0
% 2.99/1.80 #Chain : 0
% 2.99/1.80 #Close : 0
% 2.99/1.80
% 2.99/1.80 Ordering : KBO
% 2.99/1.80
% 2.99/1.80 Simplification rules
% 2.99/1.80 ----------------------
% 2.99/1.80 #Subsume : 0
% 2.99/1.80 #Demod : 1
% 2.99/1.80 #Tautology : 1
% 2.99/1.80 #SimpNegUnit : 1
% 2.99/1.80 #BackRed : 0
% 2.99/1.80
% 2.99/1.80 #Partial instantiations: 0
% 2.99/1.80 #Strategies tried : 1
% 2.99/1.80
% 2.99/1.80 Timing (in seconds)
% 2.99/1.80 ----------------------
% 2.99/1.81 Preprocessing : 0.48
% 2.99/1.81 Parsing : 0.29
% 2.99/1.81 CNF conversion : 0.03
% 2.99/1.81 Main loop : 0.16
% 2.99/1.81 Inferencing : 0.07
% 2.99/1.81 Reduction : 0.04
% 2.99/1.81 Demodulation : 0.03
% 2.99/1.81 BG Simplification : 0.01
% 2.99/1.81 Subsumption : 0.04
% 2.99/1.81 Abstraction : 0.01
% 2.99/1.81 MUC search : 0.00
% 2.99/1.81 Cooper : 0.00
% 2.99/1.81 Total : 0.68
% 2.99/1.81 Index Insertion : 0.00
% 2.99/1.81 Index Deletion : 0.00
% 2.99/1.81 Index Matching : 0.00
% 2.99/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------