TSTP Solution File: COL022-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL022-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 : n007.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:50 EDT 2023
% Result : Unsatisfiable 6.51s 2.64s
% Output : CNFRefutation 6.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 14 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 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 : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > o > m > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(o,type,
o: $i ).
tff(f_30,axiom,
! [X] : ( apply(m,X) = apply(X,X) ),
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] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_4] : ( apply(m,X_4) = apply(X_4,X_4) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_139,plain,
! [X_14,Y_15,Z_16] : ( apply(apply(apply(b,X_14),Y_15),Z_16) = apply(X_14,apply(Y_15,Z_16)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_3475,plain,
! [X_42,Y_43] : ( apply(X_42,apply(Y_43,apply(apply(b,X_42),Y_43))) = apply(m,apply(apply(b,X_42),Y_43)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_139]) ).
tff(c_8,plain,
! [Y_7] : ( apply(combinator,Y_7) != Y_7 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_3644,plain,
! [Y_43] : ( apply(m,apply(apply(b,combinator),Y_43)) != apply(Y_43,apply(apply(b,combinator),Y_43)) ),
inference(superposition,[status(thm),theory(equality)],[c_3475,c_8]) ).
tff(c_3839,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_3644]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL022-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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.20/0.36 % Computer : n007.cluster.edu
% 0.20/0.36 % Model : x86_64 x86_64
% 0.20/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.36 % Memory : 8042.1875MB
% 0.20/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.36 % CPULimit : 300
% 0.20/0.36 % WCLimit : 300
% 0.20/0.36 % DateTime : Thu Aug 3 18:01:23 EDT 2023
% 0.20/0.36 % CPUTime :
% 6.51/2.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.51/2.64
% 6.51/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.63/2.68
% 6.63/2.68 Inference rules
% 6.63/2.68 ----------------------
% 6.63/2.68 #Ref : 1
% 6.63/2.68 #Sup : 943
% 6.63/2.68 #Fact : 0
% 6.63/2.68 #Define : 0
% 6.63/2.68 #Split : 0
% 6.63/2.68 #Chain : 0
% 6.63/2.68 #Close : 0
% 6.63/2.68
% 6.63/2.68 Ordering : KBO
% 6.63/2.68
% 6.63/2.68 Simplification rules
% 6.63/2.68 ----------------------
% 6.63/2.68 #Subsume : 123
% 6.63/2.68 #Demod : 1134
% 6.63/2.68 #Tautology : 238
% 6.63/2.68 #SimpNegUnit : 0
% 6.63/2.68 #BackRed : 0
% 6.63/2.68
% 6.63/2.68 #Partial instantiations: 0
% 6.63/2.68 #Strategies tried : 1
% 6.63/2.68
% 6.63/2.68 Timing (in seconds)
% 6.63/2.68 ----------------------
% 6.63/2.68 Preprocessing : 0.40
% 6.63/2.68 Parsing : 0.21
% 6.63/2.68 CNF conversion : 0.02
% 6.63/2.68 Main loop : 1.16
% 6.63/2.68 Inferencing : 0.37
% 6.63/2.68 Reduction : 0.57
% 6.63/2.68 Demodulation : 0.51
% 6.63/2.68 BG Simplification : 0.04
% 6.63/2.68 Subsumption : 0.13
% 6.63/2.68 Abstraction : 0.06
% 6.63/2.68 MUC search : 0.00
% 6.63/2.68 Cooper : 0.00
% 6.63/2.68 Total : 1.61
% 6.63/2.68 Index Insertion : 0.00
% 6.63/2.68 Index Deletion : 0.00
% 6.63/2.68 Index Matching : 0.00
% 6.63/2.68 BG Taut test : 0.00
%------------------------------------------------------------------------------