TSTP Solution File: COL003-13 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL003-13 : TPTP v8.1.2. Released v2.1.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 : n032.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:34:46 EDT 2023
% Result : Unsatisfiable 18.97s 8.89s
% Output : CNFRefutation 19.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 19 unt; 5 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > w > strong_fixed_point > fixed_pt > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(w,type,
w: $i ).
tff(fixed_pt,type,
fixed_pt: $i ).
tff(b,type,
b: $i ).
tff(strong_fixed_point,type,
strong_fixed_point: $i ).
tff(f_29,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_32,axiom,
strong_fixed_point = apply(apply(b,apply(w,w)),apply(apply(b,apply(apply(b,w),b)),b)),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] : ( apply(apply(w,X),Y) = apply(apply(X,Y),Y) ),
file(unknown,unknown) ).
tff(f_34,axiom,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( apply(apply(apply(b,X_1),Y_2),Z_3) = apply(X_1,apply(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_6,plain,
apply(apply(b,apply(w,w)),apply(apply(b,apply(apply(b,w),b)),b)) = strong_fixed_point,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_233,plain,
! [Z_3] : ( apply(apply(w,w),apply(apply(apply(b,apply(apply(b,w),b)),b),Z_3)) = apply(strong_fixed_point,Z_3) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_239,plain,
! [Z_3] : ( apply(apply(w,w),apply(w,apply(b,apply(b,Z_3)))) = apply(strong_fixed_point,Z_3) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_233]) ).
tff(c_4,plain,
! [X_4,Y_5] : ( apply(apply(w,X_4),Y_5) = apply(apply(X_4,Y_5),Y_5) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_91,plain,
! [X_9,Y_10,Z_11] : ( apply(apply(apply(b,X_9),Y_10),Z_11) = apply(X_9,apply(Y_10,Z_11)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_127,plain,
! [X_12,Y_13] : ( apply(apply(w,apply(b,X_12)),Y_13) = apply(X_12,apply(Y_13,Y_13)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_91]) ).
tff(c_16101,plain,
! [X_86,Y_87,Z_88] : ( apply(apply(apply(w,apply(b,apply(b,X_86))),Y_87),Z_88) = apply(X_86,apply(apply(Y_87,Y_87),Z_88)) ),
inference(superposition,[status(thm),theory(equality)],[c_127,c_2]) ).
tff(c_23996,plain,
! [X_103,Y_104] : ( apply(apply(apply(w,apply(b,apply(b,X_103))),Y_104),Y_104) = apply(X_103,apply(apply(w,Y_104),Y_104)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_16101]) ).
tff(c_9,plain,
! [X_6,Y_7] : ( apply(apply(w,X_6),Y_7) = apply(apply(X_6,Y_7),Y_7) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_13,plain,
! [Y_7] : ( apply(apply(w,w),Y_7) = apply(apply(Y_7,Y_7),Y_7) ),
inference(superposition,[status(thm),theory(equality)],[c_9,c_4]) ).
tff(c_24143,plain,
! [X_103] : ( apply(X_103,apply(apply(w,apply(w,apply(b,apply(b,X_103)))),apply(w,apply(b,apply(b,X_103))))) = apply(apply(w,w),apply(w,apply(b,apply(b,X_103)))) ),
inference(superposition,[status(thm),theory(equality)],[c_23996,c_13]) ).
tff(c_24347,plain,
! [X_103] : ( apply(X_103,apply(strong_fixed_point,X_103)) = apply(strong_fixed_point,X_103) ),
inference(demodulation,[status(thm),theory(equality)],[c_239,c_239,c_4,c_24143]) ).
tff(c_8,plain,
apply(fixed_pt,apply(strong_fixed_point,fixed_pt)) != apply(strong_fixed_point,fixed_pt),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_24384,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24347,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL003-13 : TPTP v8.1.2. Released v2.1.0.
% 0.00/0.12 % 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.13/0.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 18:16:51 EDT 2023
% 0.13/0.33 % CPUTime :
% 18.97/8.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.33/8.89
% 19.33/8.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 19.33/8.92
% 19.33/8.92 Inference rules
% 19.33/8.92 ----------------------
% 19.33/8.92 #Ref : 0
% 19.33/8.92 #Sup : 5980
% 19.33/8.92 #Fact : 0
% 19.33/8.92 #Define : 0
% 19.33/8.92 #Split : 0
% 19.33/8.92 #Chain : 0
% 19.33/8.92 #Close : 0
% 19.33/8.92
% 19.33/8.92 Ordering : KBO
% 19.33/8.92
% 19.33/8.92 Simplification rules
% 19.33/8.92 ----------------------
% 19.33/8.92 #Subsume : 257
% 19.33/8.92 #Demod : 5014
% 19.33/8.92 #Tautology : 696
% 19.33/8.92 #SimpNegUnit : 0
% 19.33/8.92 #BackRed : 1
% 19.33/8.92
% 19.33/8.92 #Partial instantiations: 0
% 19.33/8.92 #Strategies tried : 1
% 19.33/8.92
% 19.33/8.92 Timing (in seconds)
% 19.33/8.92 ----------------------
% 19.33/8.92 Preprocessing : 0.40
% 19.33/8.92 Parsing : 0.21
% 19.33/8.92 CNF conversion : 0.02
% 19.33/8.92 Main loop : 7.55
% 19.33/8.92 Inferencing : 1.18
% 19.33/8.92 Reduction : 5.33
% 19.33/8.92 Demodulation : 5.09
% 19.33/8.92 BG Simplification : 0.16
% 19.33/8.92 Subsumption : 0.73
% 19.33/8.92 Abstraction : 0.29
% 19.33/8.92 MUC search : 0.00
% 19.33/8.92 Cooper : 0.00
% 19.33/8.92 Total : 7.99
% 19.33/8.92 Index Insertion : 0.00
% 19.33/8.92 Index Deletion : 0.00
% 19.33/8.92 Index Matching : 0.00
% 19.33/8.92 BG Taut test : 0.00
%------------------------------------------------------------------------------