TSTP Solution File: DAT334_8 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT334_8 : 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 : n027.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:25 EDT 2023
% Result : Theorem 2.31s 1.60s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT334_8 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.13 % 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.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 13:35:38 EDT 2023
% 0.14/0.34 % CPUTime :
% 2.31/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.31/1.61
% 2.31/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.62 %$ teach > #nlpp > sue > psych > math > mary > john > cs > #skF_1 > #skF_2 > #skF_3
% 2.82/1.62
% 2.82/1.62 %Foreground sorts:
% 2.82/1.62 tff($ki_world, type, $ki_world: $tType ).
% 2.82/1.62
% 2.82/1.62 %Background operators:
% 2.82/1.62
% 2.82/1.62
% 2.82/1.62 %Foreground operators:
% 2.82/1.62 tff(sue, type, sue: $i).
% 2.82/1.62 tff('#skF_1', type, '#skF_1': $ki_world > $i).
% 2.82/1.62 tff(psych, type, psych: $i).
% 2.82/1.62 tff(teach, type, teach: ($ki_world * $i * $i) > $o).
% 2.82/1.62 tff(math, type, math: $i).
% 2.82/1.62 tff('#skF_2', type, '#skF_2': $ki_world > $i).
% 2.82/1.62 tff(mary, type, mary: $i).
% 2.82/1.62 tff(john, type, john: $i).
% 2.82/1.62 tff('#skF_3', type, '#skF_3': $ki_world).
% 2.82/1.62 tff(cs, type, cs: $i).
% 2.82/1.62
% 2.82/1.63 tff(f_54, 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.82/1.63 tff(f_46, 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.82/1.63 tff(c_18, plain, ($ki_accessible($ki_local_world, '#skF_3')), inference(cnfTransformation, [status(thm)], [f_54])).
% 2.82/1.63 tff(c_12, plain, (![W_4:$ki_world]: ($ki_exists_in_world_$i(W_4, '#skF_2'(W_4)) | ~$ki_accessible($ki_local_world, W_4))), inference(cnfTransformation, [status(thm)], [f_46])).
% 2.82/1.63 tff(c_26, plain, (![W_15:$ki_world]: (teach(W_15, '#skF_2'(W_15), cs) | ~$ki_accessible($ki_local_world, W_15))), inference(cnfTransformation, [status(thm)], [f_46])).
% 2.82/1.63 tff(c_16, plain, (![X_7]: (~teach('#skF_3', X_7, cs) | ~$ki_exists_in_world_$i('#skF_3', X_7))), inference(cnfTransformation, [status(thm)], [f_54])).
% 2.82/1.63 tff(c_30, plain, (~$ki_exists_in_world_$i('#skF_3', '#skF_2'('#skF_3')) | ~$ki_accessible($ki_local_world, '#skF_3')), inference(resolution, [status(thm)], [c_26, c_16])).
% 2.82/1.63 tff(c_33, plain, (~$ki_exists_in_world_$i('#skF_3', '#skF_2'('#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_18, c_30])).
% 2.82/1.63 tff(c_36, plain, (~$ki_accessible($ki_local_world, '#skF_3')), inference(resolution, [status(thm)], [c_12, c_33])).
% 2.82/1.63 tff(c_40, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_18, c_36])).
% 2.82/1.63 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.82/1.63
% 2.82/1.63 Inference rules
% 2.82/1.63 ----------------------
% 2.82/1.63 #Ref : 0
% 2.82/1.63 #Sup : 2
% 2.82/1.63 #Fact : 0
% 2.82/1.63 #Define : 0
% 2.82/1.63 #Split : 0
% 2.82/1.63 #Chain : 0
% 2.82/1.63 #Close : 0
% 2.82/1.63
% 2.82/1.63 Ordering : KBO
% 2.82/1.63
% 2.82/1.63 Simplification rules
% 2.82/1.63 ----------------------
% 2.82/1.63 #Subsume : 0
% 2.82/1.63 #Demod : 2
% 2.82/1.63 #Tautology : 0
% 2.82/1.63 #SimpNegUnit : 0
% 2.82/1.63 #BackRed : 0
% 2.82/1.63
% 2.82/1.63 #Partial instantiations: 0
% 2.82/1.63 #Strategies tried : 1
% 2.82/1.63
% 2.82/1.63 Timing (in seconds)
% 2.82/1.63 ----------------------
% 2.82/1.63 Preprocessing : 0.44
% 2.82/1.63 Parsing : 0.26
% 2.82/1.64 CNF conversion : 0.03
% 2.82/1.64 Main loop : 0.15
% 2.82/1.64 Inferencing : 0.07
% 2.82/1.64 Reduction : 0.03
% 2.82/1.64 Demodulation : 0.03
% 2.82/1.64 BG Simplification : 0.01
% 2.82/1.64 Subsumption : 0.03
% 2.82/1.64 Abstraction : 0.00
% 2.82/1.64 MUC search : 0.00
% 2.82/1.64 Cooper : 0.00
% 2.82/1.64 Total : 0.63
% 2.82/1.64 Index Insertion : 0.00
% 2.82/1.64 Index Deletion : 0.00
% 2.82/1.64 Index Matching : 0.00
% 2.82/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------