TSTP Solution File: SYN332+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN332+1 : TPTP v8.1.2. Released v2.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 : n017.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:10:28 EDT 2023
% Result : Theorem 3.40s 1.94s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN332+1 : TPTP v8.1.2. Released v2.0.0.
% 0.15/0.15 % 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.15/0.36 % Computer : n017.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 16:56:51 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.40/1.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.40/1.95
% 3.40/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.40/1.97 %$ big_f > #nlpp > #skF_1
% 3.40/1.97
% 3.40/1.97 %Foreground sorts:
% 3.40/1.97
% 3.40/1.97
% 3.40/1.97 %Background operators:
% 3.40/1.97
% 3.40/1.97
% 3.40/1.97 %Foreground operators:
% 3.40/1.97 tff('#skF_1', type, '#skF_1': ($i * $i) > $i).
% 3.40/1.97 tff(big_f, type, big_f: ($i * $i) > $o).
% 3.40/1.97
% 3.40/1.99 tff(f_52, negated_conjecture, ~(?[X, Y]: (![Z]: (((big_f(X, Y) & big_f(Y, X)) ⇎ big_f(X, Z)) => ((big_f(X, Z) <=> big_f(Z, X)) => ((big_f(X, Z) <=> big_f(Y, Z)) => (((big_f(Y, X) => big_f(X, Y)) <=> big_f(Z, Z)) => ((big_f(X, Y) <=> big_f(Y, X)) <=> big_f(Z, Y)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', church_46_14_4)).
% 3.40/1.99 tff(c_56, plain, (![X_1, Y_2]: (big_f(X_1, Y_2) | big_f(X_1, '#skF_1'(X_1, Y_2)))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_67, plain, (![Y_16, X_17]: (big_f(Y_16, '#skF_1'(X_17, Y_16)) | ~big_f(X_17, '#skF_1'(X_17, Y_16)))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_73, plain, (![Y_2, X_1]: (big_f(Y_2, '#skF_1'(X_1, Y_2)) | big_f(X_1, Y_2))), inference(resolution, [status(thm)], [c_56, c_67])).
% 3.40/1.99 tff(c_10, plain, (![X_1, Y_2]: (big_f('#skF_1'(X_1, Y_2), X_1) | ~big_f(X_1, '#skF_1'(X_1, Y_2)))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_162, plain, (![X_35, Y_36]: (~big_f('#skF_1'(X_35, Y_36), Y_36) | big_f(X_35, Y_36) | big_f(Y_36, X_35))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_176, plain, (![X_37]: (big_f(X_37, X_37) | ~big_f(X_37, '#skF_1'(X_37, X_37)))), inference(resolution, [status(thm)], [c_10, c_162])).
% 3.40/1.99 tff(c_195, plain, (![X_1]: (big_f(X_1, X_1))), inference(resolution, [status(thm)], [c_73, c_176])).
% 3.40/1.99 tff(c_54, plain, (![Y_2, X_1]: (big_f(Y_2, X_1) | big_f(X_1, '#skF_1'(X_1, Y_2)))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_72, plain, (![Y_2, X_1]: (big_f(Y_2, '#skF_1'(X_1, Y_2)) | big_f(Y_2, X_1))), inference(resolution, [status(thm)], [c_54, c_67])).
% 3.40/1.99 tff(c_2, plain, (![X_1, Y_2]: (big_f(X_1, Y_2) | ~big_f(Y_2, X_1) | ~big_f('#skF_1'(X_1, Y_2), '#skF_1'(X_1, Y_2)))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_256, plain, (![X_42, Y_43]: (big_f(X_42, Y_43) | ~big_f(Y_43, X_42))), inference(demodulation, [status(thm), theory('equality')], [c_195, c_2])).
% 3.40/1.99 tff(c_307, plain, (![X_48, Y_49]: (big_f('#skF_1'(X_48, Y_49), Y_49) | big_f(Y_49, X_48))), inference(resolution, [status(thm)], [c_72, c_256])).
% 3.40/1.99 tff(c_30, plain, (![X_1, Y_2]: (~big_f('#skF_1'(X_1, Y_2), Y_2) | big_f(X_1, Y_2) | big_f(Y_2, X_1))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_335, plain, (![X_50, Y_51]: (big_f(X_50, Y_51) | big_f(Y_51, X_50))), inference(resolution, [status(thm)], [c_307, c_30])).
% 3.40/1.99 tff(c_12, plain, (![X_1, Y_2]: (~big_f('#skF_1'(X_1, Y_2), Y_2) | ~big_f(Y_2, X_1) | ~big_f(X_1, Y_2))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_364, plain, (![Y_52, X_53]: (~big_f(Y_52, X_53) | ~big_f(X_53, Y_52) | big_f(Y_52, '#skF_1'(X_53, Y_52)))), inference(resolution, [status(thm)], [c_335, c_12])).
% 3.40/1.99 tff(c_115, plain, (![X_28, Y_29]: (~big_f('#skF_1'(X_28, Y_29), Y_29) | ~big_f(Y_29, X_28) | ~big_f(X_28, Y_29))), inference(cnfTransformation, [status(thm)], [f_52])).
% 3.40/1.99 tff(c_120, plain, (![X_1]: (~big_f(X_1, X_1) | ~big_f(X_1, '#skF_1'(X_1, X_1)))), inference(resolution, [status(thm)], [c_10, c_115])).
% 3.40/1.99 tff(c_199, plain, (![X_1]: (~big_f(X_1, '#skF_1'(X_1, X_1)))), inference(demodulation, [status(thm), theory('equality')], [c_195, c_120])).
% 3.40/1.99 tff(c_370, plain, (![X_53]: (~big_f(X_53, X_53))), inference(resolution, [status(thm)], [c_364, c_199])).
% 3.40/1.99 tff(c_384, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_195, c_370])).
% 3.40/1.99 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.40/1.99
% 3.40/1.99 Inference rules
% 3.40/1.99 ----------------------
% 3.40/1.99 #Ref : 0
% 3.40/1.99 #Sup : 60
% 3.40/1.99 #Fact : 2
% 3.40/1.99 #Define : 0
% 3.40/1.99 #Split : 0
% 3.40/1.99 #Chain : 0
% 3.40/1.99 #Close : 0
% 3.40/1.99
% 3.40/1.99 Ordering : KBO
% 3.40/1.99
% 3.40/1.99 Simplification rules
% 3.40/1.99 ----------------------
% 3.40/1.99 #Subsume : 21
% 3.40/1.99 #Demod : 26
% 3.40/1.99 #Tautology : 44
% 3.40/1.99 #SimpNegUnit : 0
% 3.40/1.99 #BackRed : 1
% 3.40/1.99
% 3.40/1.99 #Partial instantiations: 0
% 3.40/1.99 #Strategies tried : 1
% 3.40/1.99
% 3.40/1.99 Timing (in seconds)
% 3.40/1.99 ----------------------
% 3.40/1.99 Preprocessing : 0.52
% 3.40/1.99 Parsing : 0.28
% 3.40/1.99 CNF conversion : 0.03
% 3.40/1.99 Main loop : 0.33
% 3.40/1.99 Inferencing : 0.16
% 3.40/1.99 Reduction : 0.05
% 3.40/1.99 Demodulation : 0.03
% 3.40/1.99 BG Simplification : 0.02
% 3.40/1.99 Subsumption : 0.09
% 3.40/1.99 Abstraction : 0.01
% 3.40/1.99 MUC search : 0.00
% 3.40/1.99 Cooper : 0.00
% 3.40/1.99 Total : 0.91
% 3.40/1.99 Index Insertion : 0.00
% 3.40/1.99 Index Deletion : 0.00
% 3.40/1.99 Index Matching : 0.00
% 3.40/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------