TSTP Solution File: DAT334_19 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT334_19 : 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 : n018.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.83s 1.98s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : DAT334_19 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.09 % 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.09/0.29 % Computer : n018.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Thu Aug 3 13:22:05 EDT 2023
% 0.09/0.29 % CPUTime :
% 2.83/1.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.83/1.98
% 2.83/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.83/2.00 %$ teach > #nlpp > sue > psych > math > mary > john > cs > #skF_1 > #skF_2 > #skF_3
% 2.83/2.00
% 2.83/2.00 %Foreground sorts:
% 2.83/2.00 tff($ki_world, type, $ki_world: $tType ).
% 2.83/2.00
% 2.83/2.00 %Background operators:
% 2.83/2.00
% 2.83/2.00
% 2.83/2.00 %Foreground operators:
% 2.83/2.00 tff(sue, type, sue: $i).
% 2.83/2.00 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 2.83/2.00 tff(psych, type, psych: $i).
% 2.83/2.00 tff(teach, type, teach: ($ki_world * $i * $i) > $o).
% 2.83/2.00 tff(math, type, math: $i).
% 2.83/2.00 tff('#skF_2', type, '#skF_2': $ki_world > $i).
% 2.83/2.00 tff(mary, type, mary: $i).
% 2.83/2.00 tff(john, type, john: $i).
% 2.83/2.00 tff('#skF_3', type, '#skF_3': $ki_world).
% 2.83/2.00 tff(cs, type, cs: $i).
% 2.83/2.00
% 2.83/2.01 tff(f_58, negated_conjecture, ~(![W:$ki_world]: ($ki_accessible($ki_local_world, W) => (?[X]: ($ki_exists_in_world_$i(W, X) & teach(W, X, cs))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', verify)).
% 2.83/2.01 tff(f_50, 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/sandbox/benchmark/theBenchmark.p', db)).
% 2.83/2.01 tff(c_18, plain, ($ki_accessible($ki_local_world, '#skF_3')), inference(cnfTransformation, [status(thm)], [f_58])).
% 2.83/2.01 tff(c_12, plain, (![W_6:$ki_world]: ($ki_exists_in_world_$i(W_6, '#skF_2'(W_6)) | ~$ki_accessible($ki_local_world, W_6))), inference(cnfTransformation, [status(thm)], [f_50])).
% 2.83/2.01 tff(c_25, plain, (![W_16:$ki_world]: (teach(W_16, '#skF_2'(W_16), cs) | ~$ki_accessible($ki_local_world, W_16))), inference(cnfTransformation, [status(thm)], [f_50])).
% 2.83/2.01 tff(c_16, plain, (![X_9]: (~teach('#skF_3', X_9, cs) | ~$ki_exists_in_world_$i('#skF_3', X_9))), inference(cnfTransformation, [status(thm)], [f_58])).
% 2.83/2.01 tff(c_29, plain, (~$ki_exists_in_world_$i('#skF_3', '#skF_2'('#skF_3')) | ~$ki_accessible($ki_local_world, '#skF_3')), inference(resolution, [status(thm)], [c_25, c_16])).
% 2.83/2.01 tff(c_32, plain, (~$ki_exists_in_world_$i('#skF_3', '#skF_2'('#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_18, c_29])).
% 2.83/2.01 tff(c_35, plain, (~$ki_accessible($ki_local_world, '#skF_3')), inference(resolution, [status(thm)], [c_12, c_32])).
% 2.83/2.01 tff(c_39, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_18, c_35])).
% 2.83/2.01 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.83/2.01
% 2.83/2.01 Inference rules
% 2.83/2.01 ----------------------
% 2.83/2.01 #Ref : 0
% 2.83/2.01 #Sup : 2
% 2.83/2.01 #Fact : 0
% 2.83/2.01 #Define : 0
% 2.83/2.01 #Split : 0
% 2.83/2.01 #Chain : 0
% 2.83/2.01 #Close : 0
% 2.83/2.01
% 2.83/2.01 Ordering : KBO
% 2.83/2.01
% 2.83/2.01 Simplification rules
% 2.83/2.01 ----------------------
% 2.83/2.01 #Subsume : 0
% 2.83/2.01 #Demod : 2
% 2.83/2.01 #Tautology : 0
% 2.83/2.01 #SimpNegUnit : 0
% 2.83/2.01 #BackRed : 0
% 2.83/2.01
% 2.83/2.01 #Partial instantiations: 0
% 2.83/2.01 #Strategies tried : 1
% 2.83/2.01
% 2.83/2.01 Timing (in seconds)
% 2.83/2.01 ----------------------
% 2.83/2.01 Preprocessing : 0.67
% 2.83/2.01 Parsing : 0.40
% 2.83/2.01 CNF conversion : 0.04
% 2.83/2.01 Main loop : 0.20
% 2.83/2.01 Inferencing : 0.09
% 2.83/2.01 Reduction : 0.04
% 2.83/2.01 Demodulation : 0.03
% 2.83/2.01 BG Simplification : 0.02
% 2.83/2.01 Subsumption : 0.04
% 2.83/2.01 Abstraction : 0.01
% 2.83/2.01 MUC search : 0.00
% 2.83/2.01 Cooper : 0.00
% 2.83/2.01 Total : 0.92
% 2.83/2.01 Index Insertion : 0.00
% 2.83/2.01 Index Deletion : 0.00
% 2.83/2.01 Index Matching : 0.00
% 2.83/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------