TSTP Solution File: COL033-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL033-1 : TPTP v8.1.2. Released v1.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 : n028.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:52 EDT 2023
% Result : Unsatisfiable 9.26s 3.67s
% Output : CNFRefutation 9.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > f > m > l > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(l,type,
l: $i ).
tff(f,type,
f: $i > $i ).
tff(b,type,
b: $i ).
tff(f_32,axiom,
! [X] : ( apply(m,X) = apply(X,X) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y] : ( apply(apply(l,X),Y) = apply(X,apply(Y,Y)) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [Y] : ( apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [X_6] : ( apply(m,X_6) = apply(X_6,X_6) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_26,plain,
! [X_9,Y_10] : ( apply(apply(l,X_9),Y_10) = apply(X_9,apply(Y_10,Y_10)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_70,plain,
! [X_11,X_12] : ( apply(apply(l,X_11),X_12) = apply(X_11,apply(m,X_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_26]) ).
tff(c_106,plain,
! [X_11] : ( apply(X_11,apply(m,apply(l,X_11))) = apply(m,apply(l,X_11)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_70]) ).
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_28]) ).
tff(c_233,plain,
! [X_16,Y_17,Z_18] : ( apply(apply(apply(b,X_16),Y_17),Z_18) = apply(X_16,apply(Y_17,Z_18)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_8,plain,
! [Y_7] : ( apply(f(Y_7),apply(Y_7,f(Y_7))) != apply(Y_7,f(Y_7)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_240,plain,
! [X_16,Y_17] : ( apply(f(apply(apply(b,X_16),Y_17)),apply(X_16,apply(Y_17,f(apply(apply(b,X_16),Y_17))))) != apply(apply(apply(b,X_16),Y_17),f(apply(apply(b,X_16),Y_17))) ),
inference(superposition,[status(thm),theory(equality)],[c_233,c_8]) ).
tff(c_11187,plain,
! [X_66,Y_67] : ( apply(f(apply(apply(b,X_66),Y_67)),apply(X_66,apply(Y_67,f(apply(apply(b,X_66),Y_67))))) != apply(X_66,apply(Y_67,f(apply(apply(b,X_66),Y_67)))) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_240]) ).
tff(c_11579,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_106,c_11187]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL033-1 : TPTP v8.1.2. Released v1.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.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:24:09 EDT 2023
% 0.14/0.36 % CPUTime :
% 9.26/3.67 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.26/3.68
% 9.26/3.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.26/3.70
% 9.26/3.70 Inference rules
% 9.26/3.70 ----------------------
% 9.26/3.70 #Ref : 0
% 9.26/3.70 #Sup : 2595
% 9.26/3.70 #Fact : 0
% 9.26/3.70 #Define : 0
% 9.26/3.70 #Split : 0
% 9.26/3.70 #Chain : 0
% 9.26/3.70 #Close : 0
% 9.26/3.70
% 9.26/3.70 Ordering : KBO
% 9.26/3.70
% 9.26/3.70 Simplification rules
% 9.26/3.70 ----------------------
% 9.26/3.70 #Subsume : 289
% 9.26/3.70 #Demod : 2693
% 9.26/3.70 #Tautology : 539
% 9.26/3.70 #SimpNegUnit : 0
% 9.26/3.70 #BackRed : 0
% 9.26/3.70
% 9.26/3.70 #Partial instantiations: 0
% 9.26/3.70 #Strategies tried : 1
% 9.26/3.70
% 9.26/3.70 Timing (in seconds)
% 9.26/3.70 ----------------------
% 9.26/3.70 Preprocessing : 0.39
% 9.26/3.70 Parsing : 0.21
% 9.26/3.70 CNF conversion : 0.02
% 9.26/3.70 Main loop : 2.25
% 9.26/3.71 Inferencing : 0.55
% 9.26/3.71 Reduction : 1.34
% 9.26/3.71 Demodulation : 1.24
% 9.26/3.71 BG Simplification : 0.09
% 9.26/3.71 Subsumption : 0.20
% 9.26/3.71 Abstraction : 0.11
% 9.26/3.71 MUC search : 0.00
% 9.26/3.71 Cooper : 0.00
% 9.26/3.71 Total : 2.69
% 9.26/3.71 Index Insertion : 0.00
% 9.26/3.71 Index Deletion : 0.00
% 9.26/3.71 Index Matching : 0.00
% 9.26/3.71 BG Taut test : 0.00
%------------------------------------------------------------------------------