TSTP Solution File: COL070-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL070-1 : TPTP v8.1.2. Released v1.2.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 : n005.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:59 EDT 2023
% Result : Unsatisfiable 5.05s 2.38s
% Output : CNFRefutation 5.48s
% 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 > n1 > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(n1,type,
n1: $i ).
tff(f_29,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [X,Y,Z] : ( apply(apply(apply(n1,X),Y),Z) = apply(apply(apply(X,Y),Y),Z) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_4,Y_5,Z_6] : ( apply(apply(apply(b,X_4),Y_5),Z_6) = apply(X_4,apply(Y_5,Z_6)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_17,plain,
! [X_12,Y_13,Z_14] : ( apply(apply(apply(n1,X_12),Y_13),Z_14) = apply(apply(apply(X_12,Y_13),Y_13),Z_14) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_304,plain,
! [X_19,Z_20,Z_21] : ( apply(apply(apply(n1,apply(b,X_19)),Z_20),Z_21) = apply(apply(X_19,apply(Z_20,Z_20)),Z_21) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_17]) ).
tff(c_1921,plain,
! [X_38,Z_39,Z_40] : ( apply(apply(apply(n1,apply(b,apply(b,X_38))),Z_39),Z_40) = apply(X_38,apply(apply(Z_39,Z_39),Z_40)) ),
inference(superposition,[status(thm),theory(equality)],[c_304,c_4]) ).
tff(c_6,plain,
! [Y_7] : ( apply(combinator,Y_7) != Y_7 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_2218,plain,
! [Z_39,Z_40] : ( apply(apply(apply(n1,apply(b,apply(b,combinator))),Z_39),Z_40) != apply(apply(Z_39,Z_39),Z_40) ),
inference(superposition,[status(thm),theory(equality)],[c_1921,c_6]) ).
tff(c_2463,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_2218]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL070-1 : TPTP v8.1.2. Released v1.2.0.
% 0.14/0.15 % 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.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:10:27 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.05/2.38 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.05/2.38
% 5.05/2.38 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.48/2.40
% 5.48/2.40 Inference rules
% 5.48/2.40 ----------------------
% 5.48/2.40 #Ref : 1
% 5.48/2.40 #Sup : 601
% 5.48/2.40 #Fact : 0
% 5.48/2.40 #Define : 0
% 5.48/2.40 #Split : 0
% 5.48/2.40 #Chain : 0
% 5.48/2.40 #Close : 0
% 5.48/2.40
% 5.48/2.40 Ordering : KBO
% 5.48/2.40
% 5.48/2.40 Simplification rules
% 5.48/2.40 ----------------------
% 5.48/2.40 #Subsume : 23
% 5.48/2.41 #Demod : 223
% 5.48/2.41 #Tautology : 64
% 5.48/2.41 #SimpNegUnit : 0
% 5.48/2.41 #BackRed : 0
% 5.48/2.41
% 5.48/2.41 #Partial instantiations: 0
% 5.48/2.41 #Strategies tried : 1
% 5.48/2.41
% 5.48/2.41 Timing (in seconds)
% 5.48/2.41 ----------------------
% 5.48/2.41 Preprocessing : 0.39
% 5.48/2.41 Parsing : 0.21
% 5.48/2.41 CNF conversion : 0.02
% 5.48/2.41 Main loop : 0.85
% 5.48/2.41 Inferencing : 0.31
% 5.48/2.41 Reduction : 0.35
% 5.48/2.41 Demodulation : 0.31
% 5.48/2.41 BG Simplification : 0.06
% 5.48/2.41 Subsumption : 0.10
% 5.48/2.41 Abstraction : 0.05
% 5.48/2.41 MUC search : 0.00
% 5.48/2.41 Cooper : 0.00
% 5.48/2.41 Total : 1.28
% 5.48/2.41 Index Insertion : 0.00
% 5.48/2.41 Index Deletion : 0.00
% 5.48/2.41 Index Matching : 0.00
% 5.48/2.41 BG Taut test : 0.00
%------------------------------------------------------------------------------