TSTP Solution File: PUZ001+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ001+2 : TPTP v8.1.2. Released v4.0.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 : n008.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:53:49 EDT 2023
% Result : Theorem 3.62s 1.95s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ001+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:39:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.62/1.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.62/1.95
% 3.62/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.62/1.97 %$ property2 > predicate2 > predicate1 > modifier_pp > #nlpp > rich > live > kill > in > hate > comp_than > DreadburyMansion > Charles > Butler > AuntAgatha > #skF_7 > #skF_4 > #skF_8 > #skF_2 > #skF_3 > #skF_1 > #skF_9 > #skF_5 > #skF_6
% 3.62/1.97
% 3.62/1.97 %Foreground sorts:
% 3.62/1.97
% 3.62/1.97
% 3.62/1.97 %Background operators:
% 3.62/1.97
% 3.62/1.97
% 3.62/1.97 %Foreground operators:
% 3.62/1.97 tff('#skF_7', type, '#skF_7': $i > $i).
% 3.62/1.97 tff(AuntAgatha, type, AuntAgatha: $i).
% 3.62/1.97 tff(hate, type, hate: $i).
% 3.62/1.97 tff(predicate1, type, predicate1: ($i * $i * $i) > $o).
% 3.62/1.97 tff('#skF_4', type, '#skF_4': $i > $i).
% 3.62/1.97 tff(Butler, type, Butler: $i).
% 3.62/1.97 tff(comp_than, type, comp_than: $i).
% 3.62/1.97 tff(property2, type, property2: ($i * $i * $i * $i) > $o).
% 3.62/1.97 tff(modifier_pp, type, modifier_pp: ($i * $i * $i) > $o).
% 3.62/1.97 tff(live, type, live: $i).
% 3.62/1.97 tff('#skF_8', type, '#skF_8': $i > $i).
% 3.62/1.97 tff('#skF_2', type, '#skF_2': $i).
% 3.62/1.97 tff('#skF_3', type, '#skF_3': $i).
% 3.62/1.97 tff('#skF_1', type, '#skF_1': $i).
% 3.62/1.97 tff(in, type, in: $i).
% 3.62/1.97 tff('#skF_9', type, '#skF_9': ($i * $i * $i) > $i).
% 3.62/1.97 tff(kill, type, kill: $i).
% 3.62/1.97 tff(predicate2, type, predicate2: ($i * $i * $i * $i) > $o).
% 3.62/1.97 tff(rich, type, rich: $i).
% 3.62/1.97 tff(DreadburyMansion, type, DreadburyMansion: $i).
% 3.62/1.97 tff('#skF_5', type, '#skF_5': ($i * $i) > $i).
% 3.62/1.97 tff('#skF_6', type, '#skF_6': $i > $i).
% 3.62/1.97 tff(Charles, type, Charles: $i).
% 3.62/1.97
% 3.62/1.99 tff(f_123, axiom, (?[A, B, C]: ((((((((((((($true & predicate1(B, live, A)) & modifier_pp(B, in, DreadburyMansion)) & predicate2(C, kill, A, AuntAgatha)) & (![D, E]: ((($true & predicate1(E, live, D)) & modifier_pp(E, in, DreadburyMansion)) => (((D = AuntAgatha) | (D = Butler)) | (D = Charles))))) & (![F]: ($true => (![G, H]: (($true & predicate2(H, kill, F, G)) => (?[I]: predicate2(I, hate, F, G))))))) & (![J]: ($true => ~(?[K, L, M]: ((($true & predicate2(L, kill, J, K)) & property2(M, rich, comp_than, K)) & (J = M)))))) & (![N, O]: (($true & predicate2(O, hate, AuntAgatha, N)) => ~(?[P]: predicate2(P, hate, Charles, N))))) & ~(?[Q]: predicate2(Q, hate, AuntAgatha, Butler))) & (![R]: (($true & ~(R = Butler)) => (?[S]: predicate2(S, hate, AuntAgatha, R))))) & (![T]: (($true & ~(?[U]: (property2(U, rich, comp_than, AuntAgatha) & (T = U)))) => (?[V]: predicate2(V, hate, Butler, T))))) & (![W, X]: (($true & predicate2(X, hate, AuntAgatha, W)) => (?[Y]: predicate2(Y, hate, Butler, W))))) & (![Z]: ($true => ~(![A1]: ($true => (?[B1]: predicate2(B1, hate, Z, A1))))))) & ~(AuntAgatha = Butler))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', background)).
% 3.62/1.99 tff(f_126, negated_conjecture, ~(?[A]: predicate2(A, kill, AuntAgatha, AuntAgatha)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove)).
% 3.62/1.99 tff(c_2, plain, (Butler!=AuntAgatha), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_20, plain, (predicate2('#skF_3', kill, '#skF_1', AuntAgatha)), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_8, plain, (![R_55]: (predicate2('#skF_8'(R_55), hate, AuntAgatha, R_55) | R_55=Butler)), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_22, plain, (modifier_pp('#skF_2', in, DreadburyMansion)), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_24, plain, (predicate1('#skF_2', live, '#skF_1')), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_148, plain, (![D_96, E_97]: (D_96=Charles | D_96=Butler | D_96=AuntAgatha | ~modifier_pp(E_97, in, DreadburyMansion) | ~predicate1(E_97, live, D_96))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_151, plain, (Charles='#skF_1' | Butler='#skF_1' | AuntAgatha='#skF_1' | ~modifier_pp('#skF_2', in, DreadburyMansion)), inference(resolution, [status(thm)], [c_24, c_148])).
% 3.62/1.99 tff(c_154, plain, (Charles='#skF_1' | Butler='#skF_1' | AuntAgatha='#skF_1'), inference(demodulation, [status(thm), theory('equality')], [c_22, c_151])).
% 3.62/1.99 tff(c_162, plain, (AuntAgatha='#skF_1'), inference(splitLeft, [status(thm)], [c_154])).
% 3.62/1.99 tff(c_30, plain, (![A_72]: (~predicate2(A_72, kill, AuntAgatha, AuntAgatha))), inference(cnfTransformation, [status(thm)], [f_126])).
% 3.62/1.99 tff(c_174, plain, (![A_72]: (~predicate2(A_72, kill, '#skF_1', '#skF_1'))), inference(demodulation, [status(thm), theory('equality')], [c_162, c_162, c_30])).
% 3.62/1.99 tff(c_172, plain, (predicate2('#skF_3', kill, '#skF_1', '#skF_1')), inference(demodulation, [status(thm), theory('equality')], [c_162, c_20])).
% 3.62/1.99 tff(c_191, plain, $false, inference(negUnitSimplification, [status(thm)], [c_174, c_172])).
% 3.62/1.99 tff(c_192, plain, (Butler='#skF_1' | Charles='#skF_1'), inference(splitRight, [status(thm)], [c_154])).
% 3.62/1.99 tff(c_194, plain, (Charles='#skF_1'), inference(splitLeft, [status(thm)], [c_192])).
% 3.62/1.99 tff(c_108, plain, (![F_89, G_90, H_91]: (predicate2('#skF_9'(F_89, G_90, H_91), hate, F_89, G_90) | ~predicate2(H_91, kill, F_89, G_90))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_12, plain, (![P_61, N_58, O_59]: (~predicate2(P_61, hate, Charles, N_58) | ~predicate2(O_59, hate, AuntAgatha, N_58))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_120, plain, (![O_59, G_90, H_91]: (~predicate2(O_59, hate, AuntAgatha, G_90) | ~predicate2(H_91, kill, Charles, G_90))), inference(resolution, [status(thm)], [c_108, c_12])).
% 3.62/1.99 tff(c_203, plain, (![O_101, G_102, H_103]: (~predicate2(O_101, hate, AuntAgatha, G_102) | ~predicate2(H_103, kill, '#skF_1', G_102))), inference(demodulation, [status(thm), theory('equality')], [c_194, c_120])).
% 3.62/1.99 tff(c_211, plain, (![H_104, R_105]: (~predicate2(H_104, kill, '#skF_1', R_105) | R_105=Butler)), inference(resolution, [status(thm)], [c_8, c_203])).
% 3.62/1.99 tff(c_214, plain, (Butler=AuntAgatha), inference(resolution, [status(thm)], [c_20, c_211])).
% 3.62/1.99 tff(c_218, plain, $false, inference(negUnitSimplification, [status(thm)], [c_2, c_214])).
% 3.62/1.99 tff(c_219, plain, (Butler='#skF_1'), inference(splitRight, [status(thm)], [c_192])).
% 3.62/1.99 tff(c_79, plain, (![W_86, X_87]: (predicate2('#skF_5'(W_86, X_87), hate, Butler, W_86) | ~predicate2(X_87, hate, AuntAgatha, W_86))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_4, plain, (![B1_48, Z_43]: (~predicate2(B1_48, hate, Z_43, '#skF_4'(Z_43)))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_85, plain, (![X_88]: (~predicate2(X_88, hate, AuntAgatha, '#skF_4'(Butler)))), inference(resolution, [status(thm)], [c_79, c_4])).
% 3.62/1.99 tff(c_90, plain, ('#skF_4'(Butler)=Butler), inference(resolution, [status(thm)], [c_8, c_85])).
% 3.62/1.99 tff(c_53, plain, (![T_78]: ('#skF_6'(T_78)=T_78 | predicate2('#skF_7'(T_78), hate, Butler, T_78))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_58, plain, ('#skF_6'('#skF_4'(Butler))='#skF_4'(Butler)), inference(resolution, [status(thm)], [c_53, c_4])).
% 3.62/1.99 tff(c_65, plain, (![T_85]: (property2('#skF_6'(T_85), rich, comp_than, AuntAgatha) | predicate2('#skF_7'(T_85), hate, Butler, T_85))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_71, plain, (property2('#skF_6'('#skF_4'(Butler)), rich, comp_than, AuntAgatha)), inference(resolution, [status(thm)], [c_65, c_4])).
% 3.62/1.99 tff(c_75, plain, (property2('#skF_4'(Butler), rich, comp_than, AuntAgatha)), inference(demodulation, [status(thm), theory('equality')], [c_58, c_71])).
% 3.62/1.99 tff(c_92, plain, (property2(Butler, rich, comp_than, AuntAgatha)), inference(demodulation, [status(thm), theory('equality')], [c_90, c_75])).
% 3.62/1.99 tff(c_14, plain, (![M_65, K_63, L_64]: (~property2(M_65, rich, comp_than, K_63) | ~predicate2(L_64, kill, M_65, K_63))), inference(cnfTransformation, [status(thm)], [f_123])).
% 3.62/1.99 tff(c_126, plain, (![L_64]: (~predicate2(L_64, kill, Butler, AuntAgatha))), inference(resolution, [status(thm)], [c_92, c_14])).
% 3.62/1.99 tff(c_224, plain, (![L_64]: (~predicate2(L_64, kill, '#skF_1', AuntAgatha))), inference(demodulation, [status(thm), theory('equality')], [c_219, c_126])).
% 3.62/1.99 tff(c_283, plain, $false, inference(negUnitSimplification, [status(thm)], [c_224, c_20])).
% 3.62/1.99 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.62/1.99
% 3.62/1.99 Inference rules
% 3.62/1.99 ----------------------
% 3.62/1.99 #Ref : 0
% 3.62/1.99 #Sup : 55
% 3.62/1.99 #Fact : 0
% 3.62/1.99 #Define : 0
% 3.62/1.99 #Split : 2
% 3.62/1.99 #Chain : 0
% 3.62/1.99 #Close : 0
% 3.62/1.99
% 3.62/1.99 Ordering : KBO
% 3.62/1.99
% 3.62/1.99 Simplification rules
% 3.62/1.99 ----------------------
% 3.62/1.99 #Subsume : 13
% 3.62/1.99 #Demod : 45
% 3.62/1.99 #Tautology : 24
% 3.62/1.99 #SimpNegUnit : 3
% 3.62/1.99 #BackRed : 34
% 3.62/1.99
% 3.62/1.99 #Partial instantiations: 0
% 3.62/1.99 #Strategies tried : 1
% 3.62/1.99
% 3.62/1.99 Timing (in seconds)
% 3.62/1.99 ----------------------
% 3.62/1.99 Preprocessing : 0.53
% 3.62/1.99 Parsing : 0.28
% 3.62/1.99 CNF conversion : 0.04
% 3.62/1.99 Main loop : 0.33
% 3.62/1.99 Inferencing : 0.12
% 3.62/1.99 Reduction : 0.09
% 3.62/1.99 Demodulation : 0.06
% 3.62/1.99 BG Simplification : 0.02
% 3.62/1.99 Subsumption : 0.06
% 3.62/1.99 Abstraction : 0.01
% 3.62/1.99 MUC search : 0.00
% 3.62/1.99 Cooper : 0.00
% 3.62/1.99 Total : 0.92
% 3.62/1.99 Index Insertion : 0.00
% 3.62/1.99 Index Deletion : 0.00
% 3.62/1.99 Index Matching : 0.00
% 3.62/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------