TSTP Solution File: COL061-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL061-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:56 EDT 2023
% Result : Unsatisfiable 5.50s 2.42s
% Output : CNFRefutation 5.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 18 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > h > g > f > t > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(t,type,
t: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(b,type,
b: $i ).
tff(h,type,
h: $i > $i ).
tff(f_28,axiom,
! [X,Y] : ( apply(apply(t,X),Y) = apply(Y,X) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X] : ( apply(apply(apply(X,f(X)),g(X)),h(X)) != apply(f(X),apply(h(X),g(X))) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_4,Y_5] : ( apply(apply(t,X_4),Y_5) = apply(Y_5,X_4) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
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_26]) ).
tff(c_25,plain,
! [X_12] : ( apply(apply(apply(X_12,f(X_12)),g(X_12)),h(X_12)) != apply(f(X_12),apply(h(X_12),g(X_12))) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_74,plain,
! [X_17,Y_18] : ( apply(apply(apply(X_17,apply(Y_18,f(apply(apply(b,X_17),Y_18)))),g(apply(apply(b,X_17),Y_18))),h(apply(apply(b,X_17),Y_18))) != apply(f(apply(apply(b,X_17),Y_18)),apply(h(apply(apply(b,X_17),Y_18)),g(apply(apply(b,X_17),Y_18)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_25]) ).
tff(c_138,plain,
! [Y_22,X_23] : ( apply(apply(apply(apply(Y_22,f(apply(apply(b,apply(t,X_23)),Y_22))),X_23),g(apply(apply(b,apply(t,X_23)),Y_22))),h(apply(apply(b,apply(t,X_23)),Y_22))) != apply(f(apply(apply(b,apply(t,X_23)),Y_22)),apply(h(apply(apply(b,apply(t,X_23)),Y_22)),g(apply(apply(b,apply(t,X_23)),Y_22)))) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_74]) ).
tff(c_1445,plain,
! [X_169,Y_170,X_171] : ( apply(apply(apply(apply(X_169,apply(Y_170,f(apply(apply(b,apply(t,X_171)),apply(apply(b,X_169),Y_170))))),X_171),g(apply(apply(b,apply(t,X_171)),apply(apply(b,X_169),Y_170)))),h(apply(apply(b,apply(t,X_171)),apply(apply(b,X_169),Y_170)))) != apply(f(apply(apply(b,apply(t,X_171)),apply(apply(b,X_169),Y_170))),apply(h(apply(apply(b,apply(t,X_171)),apply(apply(b,X_169),Y_170))),g(apply(apply(b,apply(t,X_171)),apply(apply(b,X_169),Y_170))))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_138]) ).
tff(c_1538,plain,
! [Y_178,Y_179] : ( apply(apply(apply(Y_178,f(apply(apply(b,apply(t,Y_179)),apply(apply(b,b),Y_178)))),apply(Y_179,g(apply(apply(b,apply(t,Y_179)),apply(apply(b,b),Y_178))))),h(apply(apply(b,apply(t,Y_179)),apply(apply(b,b),Y_178)))) != apply(f(apply(apply(b,apply(t,Y_179)),apply(apply(b,b),Y_178))),apply(h(apply(apply(b,apply(t,Y_179)),apply(apply(b,b),Y_178))),g(apply(apply(b,apply(t,Y_179)),apply(apply(b,b),Y_178))))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1445]) ).
tff(c_1567,plain,
! [Y_180] : ( apply(f(apply(apply(b,apply(t,Y_180)),apply(apply(b,b),b))),apply(apply(Y_180,g(apply(apply(b,apply(t,Y_180)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,Y_180)),apply(apply(b,b),b))))) != apply(f(apply(apply(b,apply(t,Y_180)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,Y_180)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,Y_180)),apply(apply(b,b),b))))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1538]) ).
tff(c_1585,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_4,c_1567]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COL061-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu Aug 3 18:13:51 EDT 2023
% 0.11/0.31 % CPUTime :
% 5.50/2.42 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.50/2.42
% 5.50/2.42 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.50/2.46
% 5.50/2.46 Inference rules
% 5.50/2.46 ----------------------
% 5.50/2.46 #Ref : 0
% 5.50/2.46 #Sup : 366
% 5.50/2.46 #Fact : 0
% 5.50/2.46 #Define : 0
% 5.50/2.46 #Split : 0
% 5.50/2.46 #Chain : 0
% 5.50/2.46 #Close : 0
% 5.50/2.46
% 5.50/2.46 Ordering : KBO
% 5.50/2.46
% 5.50/2.46 Simplification rules
% 5.50/2.46 ----------------------
% 5.50/2.46 #Subsume : 25
% 5.50/2.46 #Demod : 0
% 5.50/2.46 #Tautology : 4
% 5.50/2.46 #SimpNegUnit : 0
% 5.50/2.46 #BackRed : 0
% 5.50/2.46
% 5.50/2.46 #Partial instantiations: 0
% 5.50/2.46 #Strategies tried : 1
% 5.50/2.46
% 5.50/2.46 Timing (in seconds)
% 5.50/2.46 ----------------------
% 5.50/2.47 Preprocessing : 0.43
% 5.50/2.47 Parsing : 0.24
% 5.50/2.47 CNF conversion : 0.02
% 5.50/2.47 Main loop : 0.97
% 5.50/2.47 Inferencing : 0.40
% 5.50/2.47 Reduction : 0.25
% 5.50/2.47 Demodulation : 0.20
% 5.50/2.47 BG Simplification : 0.06
% 5.50/2.47 Subsumption : 0.21
% 5.50/2.47 Abstraction : 0.06
% 5.50/2.47 MUC search : 0.00
% 5.50/2.47 Cooper : 0.00
% 5.50/2.47 Total : 1.46
% 5.50/2.47 Index Insertion : 0.00
% 5.50/2.47 Index Deletion : 0.00
% 5.50/2.47 Index Matching : 0.00
% 5.50/2.47 BG Taut test : 0.00
%------------------------------------------------------------------------------