TSTP Solution File: SYO887_22 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO887_22 : 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 : n004.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.74s 1.62s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO887_22 : 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.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 3 15:53:56 EDT 2023
% 0.12/0.34 % CPUTime :
% 2.74/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.62
% 2.74/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.63 %$ f > #nlpp > #skF_1 > #skF_2
% 2.74/1.63
% 2.74/1.63 %Foreground sorts:
% 2.74/1.63 tff($ki_world, type, $ki_world: $tType ).
% 2.74/1.63
% 2.74/1.63 %Background operators:
% 2.74/1.63
% 2.74/1.63
% 2.74/1.63 %Foreground operators:
% 2.74/1.63 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 2.74/1.63 tff(f, type, f: ($ki_world * $i) > $o).
% 2.74/1.63 tff('#skF_2', type, '#skF_2': $ki_world > $i).
% 2.74/1.63
% 2.74/1.64 tff(f_30, axiom, (![W:$ki_world]: $ki_accessible(W, W)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_reflexive)).
% 2.74/1.64 tff(f_61, negated_conjecture, ~((![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[X]: ($ki_exists_in_world_$i(W, X) & f(W, X))))) => (?[X]: ($ki_exists_in_world_$i($ki_local_world, X) & (?[W:$ki_world]: ($ki_accessible($ki_local_world, W) & f(W, X)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', verify)).
% 2.74/1.64 tff(c_2, plain, (![W_1:$ki_world]: ($ki_accessible(W_1, W_1))), inference(cnfTransformation, [status(thm)], [f_30])).
% 2.74/1.64 tff(c_14, plain, (![W_10:$ki_world]: ($ki_exists_in_world_$i(W_10, '#skF_2'(W_10)) | ~$ki_accessible($ki_local_world, W_10))), inference(cnfTransformation, [status(thm)], [f_61])).
% 2.74/1.64 tff(c_12, plain, (![W_10:$ki_world]: (f(W_10, '#skF_2'(W_10)) | ~$ki_accessible($ki_local_world, W_10))), inference(cnfTransformation, [status(thm)], [f_61])).
% 2.74/1.64 tff(c_23, plain, (![W_22:$ki_world, X_23]: (~f(W_22, X_23) | ~$ki_accessible($ki_local_world, W_22) | ~$ki_exists_in_world_$i($ki_local_world, X_23))), inference(cnfTransformation, [status(thm)], [f_61])).
% 2.74/1.64 tff(c_28, plain, (![W_24:$ki_world]: (~$ki_exists_in_world_$i($ki_local_world, '#skF_2'(W_24)) | ~$ki_accessible($ki_local_world, W_24))), inference(resolution, [status(thm)], [c_12, c_23])).
% 2.74/1.64 tff(c_32, plain, (~$ki_accessible($ki_local_world, $ki_local_world)), inference(resolution, [status(thm)], [c_14, c_28])).
% 2.74/1.64 tff(c_36, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_2, c_32])).
% 2.74/1.64 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.64
% 2.74/1.64 Inference rules
% 2.74/1.64 ----------------------
% 2.74/1.64 #Ref : 0
% 2.74/1.64 #Sup : 3
% 2.74/1.64 #Fact : 0
% 2.74/1.64 #Define : 0
% 2.74/1.64 #Split : 0
% 2.74/1.64 #Chain : 0
% 2.74/1.64 #Close : 0
% 2.74/1.64
% 2.74/1.64 Ordering : KBO
% 2.74/1.64
% 2.74/1.64 Simplification rules
% 2.74/1.64 ----------------------
% 2.74/1.64 #Subsume : 0
% 2.74/1.64 #Demod : 1
% 2.74/1.64 #Tautology : 1
% 2.74/1.64 #SimpNegUnit : 0
% 2.74/1.64 #BackRed : 0
% 2.74/1.64
% 2.74/1.64 #Partial instantiations: 0
% 2.74/1.64 #Strategies tried : 1
% 2.74/1.64
% 2.74/1.64 Timing (in seconds)
% 2.74/1.64 ----------------------
% 2.74/1.64 Preprocessing : 0.46
% 2.74/1.64 Parsing : 0.28
% 2.74/1.65 CNF conversion : 0.03
% 2.74/1.65 Main loop : 0.15
% 2.74/1.65 Inferencing : 0.07
% 2.74/1.65 Reduction : 0.03
% 2.74/1.65 Demodulation : 0.02
% 2.90/1.65 BG Simplification : 0.01
% 2.90/1.65 Subsumption : 0.03
% 2.90/1.65 Abstraction : 0.00
% 2.90/1.65 MUC search : 0.00
% 2.90/1.65 Cooper : 0.00
% 2.90/1.65 Total : 0.65
% 2.90/1.65 Index Insertion : 0.00
% 2.90/1.65 Index Deletion : 0.00
% 2.90/1.65 Index Matching : 0.00
% 2.90/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------