TSTP Solution File: COL027-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL027-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 : n025.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:51 EDT 2023
% Result : Unsatisfiable 10.27s 3.79s
% Output : CNFRefutation 10.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 4 avg)
% Maximal term depth : 6 ( 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > h > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(f_28,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y,Z] : ( apply(apply(apply(h,X),Y),Z) = apply(apply(apply(X,Y),Z),Y) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
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_28]) ).
tff(c_17,plain,
! [X_12,Y_13,Z_14] : ( apply(apply(apply(h,X_12),Y_13),Z_14) = apply(apply(apply(X_12,Y_13),Z_14),Y_13) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_491,plain,
! [X_21,Y_22,Z_23] : ( apply(apply(apply(h,apply(b,X_21)),Y_22),Z_23) = apply(apply(X_21,apply(Y_22,Z_23)),Y_22) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_17]) ).
tff(c_5580,plain,
! [X_56,Y_57,Z_58] : ( apply(apply(apply(h,apply(b,apply(b,X_56))),Y_57),Z_58) = apply(X_56,apply(apply(Y_57,Z_58),Y_57)) ),
inference(superposition,[status(thm),theory(equality)],[c_491,c_2]) ).
tff(c_6,plain,
! [Y_7] : ( apply(combinator,Y_7) != Y_7 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_6092,plain,
! [Y_57,Z_58] : ( apply(apply(apply(h,apply(b,apply(b,combinator))),Y_57),Z_58) != apply(apply(Y_57,Z_58),Y_57) ),
inference(superposition,[status(thm),theory(equality)],[c_5580,c_6]) ).
tff(c_7361,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_6092]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL027-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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 : n025.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:27:34 EDT 2023
% 0.14/0.36 % CPUTime :
% 10.27/3.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.59/3.79
% 10.59/3.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.59/3.82
% 10.59/3.82 Inference rules
% 10.59/3.82 ----------------------
% 10.59/3.82 #Ref : 1
% 10.59/3.82 #Sup : 2001
% 10.59/3.82 #Fact : 0
% 10.59/3.82 #Define : 0
% 10.59/3.82 #Split : 0
% 10.59/3.82 #Chain : 0
% 10.59/3.82 #Close : 0
% 10.59/3.82
% 10.59/3.82 Ordering : KBO
% 10.59/3.82
% 10.59/3.82 Simplification rules
% 10.59/3.82 ----------------------
% 10.59/3.82 #Subsume : 95
% 10.59/3.82 #Demod : 477
% 10.59/3.82 #Tautology : 168
% 10.59/3.82 #SimpNegUnit : 0
% 10.59/3.82 #BackRed : 0
% 10.59/3.82
% 10.59/3.82 #Partial instantiations: 0
% 10.59/3.82 #Strategies tried : 1
% 10.59/3.82
% 10.59/3.82 Timing (in seconds)
% 10.59/3.82 ----------------------
% 10.59/3.82 Preprocessing : 0.39
% 10.59/3.82 Parsing : 0.21
% 10.59/3.82 CNF conversion : 0.02
% 10.59/3.82 Main loop : 2.24
% 10.59/3.82 Inferencing : 0.66
% 10.59/3.82 Reduction : 1.17
% 10.59/3.82 Demodulation : 1.08
% 10.59/3.82 BG Simplification : 0.10
% 10.59/3.82 Subsumption : 0.25
% 10.59/3.82 Abstraction : 0.12
% 10.59/3.83 MUC search : 0.00
% 10.59/3.83 Cooper : 0.00
% 10.59/3.83 Total : 2.68
% 10.59/3.83 Index Insertion : 0.00
% 10.59/3.83 Index Deletion : 0.00
% 10.59/3.83 Index Matching : 0.00
% 10.59/3.83 BG Taut test : 0.00
%------------------------------------------------------------------------------