TSTP Solution File: DAT333_3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT333_3 : 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 : n003.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:37:24 EDT 2023
% Result : Theorem 2.77s 1.72s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT333_3 : TPTP v8.2.0. Released v8.2.0.
% 0.13/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 : n003.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 13:16:38 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.77/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.77/1.72
% 2.77/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.74 %$ teach > #nlpp > sue > psych > math > mary > john > cs > #skF_3 > #skF_2 > #skF_4 > #skF_1
% 2.85/1.74
% 2.85/1.74 %Foreground sorts:
% 2.85/1.74 tff($ki_world, type, $ki_world: $tType ).
% 2.85/1.74
% 2.85/1.74 %Background operators:
% 2.85/1.74
% 2.85/1.74
% 2.85/1.74 %Foreground operators:
% 2.85/1.74 tff(sue, type, sue: $i).
% 2.85/1.74 tff(psych, type, psych: $i).
% 2.85/1.74 tff(teach, type, teach: ($ki_world * $i * $i) > $o).
% 2.85/1.74 tff(math, type, math: $i).
% 2.85/1.74 tff('#skF_3', type, '#skF_3': $ki_world > $i).
% 2.85/1.74 tff('#skF_2', type, '#skF_2': $ki_world > $i).
% 2.85/1.74 tff(mary, type, mary: $i).
% 2.85/1.74 tff(john, type, john: $i).
% 2.85/1.74 tff('#skF_4', type, '#skF_4': $i > $ki_world).
% 2.85/1.74 tff('#skF_1', type, '#skF_1': $ki_world > $ki_world).
% 2.85/1.74 tff(cs, type, cs: $i).
% 2.85/1.74
% 2.85/1.75 tff(f_33, axiom, (![W:$ki_world, X]: $ki_exists_in_world_$i(W, X)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', $ki_exists_in_world_$i_const)).
% 2.85/1.75 tff(f_57, negated_conjecture, ~(?[X]: ($ki_exists_in_world_$i($ki_local_world, X) & (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => teach(W, john, X))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', verify)).
% 2.85/1.75 tff(f_49, axiom, (![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (((teach(W, john, math) & (?[X]: ($ki_exists_in_world_$i(W, X) & teach(W, X, cs)))) & teach(W, mary, psych)) & teach(W, sue, psych)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', db)).
% 2.85/1.75 tff(c_4, plain, (![W_3:$ki_world, X_4]: ($ki_exists_in_world_$i(W_3, X_4))), inference(cnfTransformation, [status(thm)], [f_33])).
% 2.85/1.75 tff(c_20, plain, (![X_9]: ($ki_accessible($ki_local_world, '#skF_4'(X_9)) | ~$ki_exists_in_world_$i($ki_local_world, X_9))), inference(cnfTransformation, [status(thm)], [f_57])).
% 2.85/1.75 tff(c_23, plain, (![X_9]: ($ki_accessible($ki_local_world, '#skF_4'(X_9)))), inference(demodulation, [status(thm), theory('equality')], [c_4, c_20])).
% 2.85/1.75 tff(c_32, plain, (![W_17:$ki_world]: (teach(W_17, john, math) | ~$ki_accessible($ki_local_world, W_17))), inference(cnfTransformation, [status(thm)], [f_49])).
% 2.85/1.75 tff(c_18, plain, (![X_9]: (~teach('#skF_4'(X_9), john, X_9) | ~$ki_exists_in_world_$i($ki_local_world, X_9))), inference(cnfTransformation, [status(thm)], [f_57])).
% 2.85/1.75 tff(c_26, plain, (![X_9]: (~teach('#skF_4'(X_9), john, X_9))), inference(demodulation, [status(thm), theory('equality')], [c_4, c_18])).
% 2.85/1.75 tff(c_36, plain, (~$ki_accessible($ki_local_world, '#skF_4'(math))), inference(resolution, [status(thm)], [c_32, c_26])).
% 2.85/1.75 tff(c_40, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_23, c_36])).
% 2.85/1.75 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.75
% 2.85/1.75 Inference rules
% 2.85/1.75 ----------------------
% 2.85/1.75 #Ref : 0
% 2.85/1.75 #Sup : 1
% 2.85/1.75 #Fact : 0
% 2.85/1.75 #Define : 0
% 2.85/1.75 #Split : 0
% 2.85/1.75 #Chain : 0
% 2.85/1.75 #Close : 0
% 2.85/1.75
% 2.85/1.75 Ordering : KBO
% 2.85/1.75
% 2.85/1.75 Simplification rules
% 2.85/1.75 ----------------------
% 2.85/1.75 #Subsume : 0
% 2.85/1.75 #Demod : 5
% 2.85/1.75 #Tautology : 2
% 2.85/1.75 #SimpNegUnit : 0
% 2.85/1.75 #BackRed : 0
% 2.85/1.75
% 2.85/1.75 #Partial instantiations: 0
% 2.85/1.75 #Strategies tried : 1
% 2.85/1.75
% 2.85/1.75 Timing (in seconds)
% 2.85/1.75 ----------------------
% 2.85/1.76 Preprocessing : 0.51
% 2.85/1.76 Parsing : 0.31
% 2.85/1.76 CNF conversion : 0.03
% 2.85/1.76 Main loop : 0.15
% 2.85/1.76 Inferencing : 0.07
% 2.85/1.76 Reduction : 0.03
% 2.85/1.76 Demodulation : 0.03
% 2.85/1.76 BG Simplification : 0.01
% 2.85/1.76 Subsumption : 0.03
% 2.85/1.76 Abstraction : 0.00
% 2.85/1.76 MUC search : 0.00
% 2.85/1.76 Cooper : 0.00
% 2.85/1.76 Total : 0.71
% 2.85/1.76 Index Insertion : 0.00
% 2.85/1.76 Index Deletion : 0.00
% 2.85/1.76 Index Matching : 0.00
% 2.85/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------