TSTP Solution File: COL063-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL063-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 : 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:57 EDT 2023
% Result : Unsatisfiable 18.86s 9.46s
% Output : CNFRefutation 18.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 20 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 13 ( 3 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 : 31 (; 31 !; 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(apply(h(X),g(X)),f(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(apply(h(X_12),g(X_12)),f(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(apply(h(apply(apply(b,X_17),Y_18)),g(apply(apply(b,X_17),Y_18))),f(apply(apply(b,X_17),Y_18))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_25]) ).
tff(c_350,plain,
! [X_42,X_43,Y_44] : ( apply(apply(apply(X_42,apply(X_43,apply(Y_44,f(apply(apply(b,X_42),apply(apply(b,X_43),Y_44)))))),g(apply(apply(b,X_42),apply(apply(b,X_43),Y_44)))),h(apply(apply(b,X_42),apply(apply(b,X_43),Y_44)))) != apply(apply(h(apply(apply(b,X_42),apply(apply(b,X_43),Y_44))),g(apply(apply(b,X_42),apply(apply(b,X_43),Y_44)))),f(apply(apply(b,X_42),apply(apply(b,X_43),Y_44)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_74]) ).
tff(c_2543,plain,
! [X_290,X_291,Y_292,Y_293] : ( apply(apply(apply(X_290,apply(X_291,apply(Y_292,apply(Y_293,f(apply(apply(b,X_290),apply(apply(b,apply(apply(b,X_291),Y_292)),Y_293))))))),g(apply(apply(b,X_290),apply(apply(b,apply(apply(b,X_291),Y_292)),Y_293)))),h(apply(apply(b,X_290),apply(apply(b,apply(apply(b,X_291),Y_292)),Y_293)))) != apply(apply(h(apply(apply(b,X_290),apply(apply(b,apply(apply(b,X_291),Y_292)),Y_293))),g(apply(apply(b,X_290),apply(apply(b,apply(apply(b,X_291),Y_292)),Y_293)))),f(apply(apply(b,X_290),apply(apply(b,apply(apply(b,X_291),Y_292)),Y_293)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_350]) ).
tff(c_11530,plain,
! [X_1379,Y_1380,Y_1381,X_1382] : ( apply(apply(apply(apply(X_1379,apply(Y_1380,apply(Y_1381,f(apply(apply(b,apply(t,X_1382)),apply(apply(b,apply(apply(b,X_1379),Y_1380)),Y_1381)))))),X_1382),g(apply(apply(b,apply(t,X_1382)),apply(apply(b,apply(apply(b,X_1379),Y_1380)),Y_1381)))),h(apply(apply(b,apply(t,X_1382)),apply(apply(b,apply(apply(b,X_1379),Y_1380)),Y_1381)))) != apply(apply(h(apply(apply(b,apply(t,X_1382)),apply(apply(b,apply(apply(b,X_1379),Y_1380)),Y_1381))),g(apply(apply(b,apply(t,X_1382)),apply(apply(b,apply(apply(b,X_1379),Y_1380)),Y_1381)))),f(apply(apply(b,apply(t,X_1382)),apply(apply(b,apply(apply(b,X_1379),Y_1380)),Y_1381)))) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_2543]) ).
tff(c_13823,plain,
! [Y_1630,Y_1631,Y_1632] : ( apply(apply(apply(Y_1630,apply(Y_1631,f(apply(apply(b,apply(t,Y_1632)),apply(apply(b,apply(apply(b,b),Y_1630)),Y_1631))))),apply(Y_1632,g(apply(apply(b,apply(t,Y_1632)),apply(apply(b,apply(apply(b,b),Y_1630)),Y_1631))))),h(apply(apply(b,apply(t,Y_1632)),apply(apply(b,apply(apply(b,b),Y_1630)),Y_1631)))) != apply(apply(h(apply(apply(b,apply(t,Y_1632)),apply(apply(b,apply(apply(b,b),Y_1630)),Y_1631))),g(apply(apply(b,apply(t,Y_1632)),apply(apply(b,apply(apply(b,b),Y_1630)),Y_1631)))),f(apply(apply(b,apply(t,Y_1632)),apply(apply(b,apply(apply(b,b),Y_1630)),Y_1631)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_11530]) ).
tff(c_13860,plain,
! [Y_1633,Y_1634] : ( apply(apply(Y_1633,f(apply(apply(b,apply(t,Y_1634)),apply(apply(b,apply(apply(b,b),b)),Y_1633)))),apply(apply(Y_1634,g(apply(apply(b,apply(t,Y_1634)),apply(apply(b,apply(apply(b,b),b)),Y_1633)))),h(apply(apply(b,apply(t,Y_1634)),apply(apply(b,apply(apply(b,b),b)),Y_1633))))) != apply(apply(h(apply(apply(b,apply(t,Y_1634)),apply(apply(b,apply(apply(b,b),b)),Y_1633))),g(apply(apply(b,apply(t,Y_1634)),apply(apply(b,apply(apply(b,b),b)),Y_1633)))),f(apply(apply(b,apply(t,Y_1634)),apply(apply(b,apply(apply(b,b),b)),Y_1633)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_13823]) ).
tff(c_13893,plain,
! [Y_1635] : ( apply(apply(Y_1635,f(apply(apply(b,apply(t,t)),apply(apply(b,apply(apply(b,b),b)),Y_1635)))),apply(h(apply(apply(b,apply(t,t)),apply(apply(b,apply(apply(b,b),b)),Y_1635))),g(apply(apply(b,apply(t,t)),apply(apply(b,apply(apply(b,b),b)),Y_1635))))) != apply(apply(h(apply(apply(b,apply(t,t)),apply(apply(b,apply(apply(b,b),b)),Y_1635))),g(apply(apply(b,apply(t,t)),apply(apply(b,apply(apply(b,b),b)),Y_1635)))),f(apply(apply(b,apply(t,t)),apply(apply(b,apply(apply(b,b),b)),Y_1635)))) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_13860]) ).
tff(c_13911,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_4,c_13893]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL063-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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:11:51 EDT 2023
% 0.13/0.33 % CPUTime :
% 18.86/9.46 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.86/9.47
% 18.86/9.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 18.86/9.49
% 18.86/9.49 Inference rules
% 18.86/9.49 ----------------------
% 18.86/9.49 #Ref : 0
% 18.86/9.49 #Sup : 3252
% 18.86/9.49 #Fact : 0
% 18.86/9.49 #Define : 0
% 18.86/9.49 #Split : 0
% 18.86/9.49 #Chain : 0
% 18.86/9.49 #Close : 0
% 18.86/9.49
% 18.86/9.49 Ordering : KBO
% 18.86/9.49
% 18.86/9.49 Simplification rules
% 18.86/9.49 ----------------------
% 18.86/9.49 #Subsume : 298
% 18.86/9.49 #Demod : 0
% 18.86/9.49 #Tautology : 4
% 18.86/9.49 #SimpNegUnit : 0
% 18.86/9.49 #BackRed : 0
% 18.86/9.49
% 18.86/9.49 #Partial instantiations: 0
% 18.86/9.49 #Strategies tried : 1
% 18.86/9.49
% 18.86/9.49 Timing (in seconds)
% 18.86/9.49 ----------------------
% 18.86/9.50 Preprocessing : 0.38
% 18.86/9.50 Parsing : 0.21
% 18.86/9.50 CNF conversion : 0.02
% 18.86/9.50 Main loop : 8.09
% 18.86/9.50 Inferencing : 2.13
% 18.86/9.50 Reduction : 1.48
% 18.86/9.50 Demodulation : 0.99
% 18.86/9.50 BG Simplification : 0.34
% 18.86/9.50 Subsumption : 3.75
% 18.86/9.50 Abstraction : 0.40
% 18.86/9.50 MUC search : 0.00
% 18.86/9.50 Cooper : 0.00
% 18.86/9.50 Total : 8.51
% 18.86/9.50 Index Insertion : 0.00
% 18.86/9.50 Index Deletion : 0.00
% 18.86/9.50 Index Matching : 0.00
% 18.86/9.50 BG Taut test : 0.00
%------------------------------------------------------------------------------