TSTP Solution File: COL021-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL021-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 : n023.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 4.50s 2.53s
% Output : CNFRefutation 4.50s
% 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 > v > 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(v,type,
v: $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] : ( apply(m,X) = apply(X,X) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_27,plain,
! [X_11,Y_12,Z_13] : ( apply(apply(apply(b,X_11),Y_12),Z_13) = apply(X_11,apply(Y_12,Z_13)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_4,plain,
! [X_4] : ( apply(m,X_4) = apply(X_4,X_4) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_855,plain,
! [X_32,Y_33] : ( apply(X_32,apply(Y_33,apply(apply(b,X_32),Y_33))) = apply(m,apply(apply(b,X_32),Y_33)) ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_4]) ).
tff(c_8,plain,
! [Y_8] : ( apply(combinator,Y_8) != Y_8 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_953,plain,
! [Y_33] : ( apply(m,apply(apply(b,combinator),Y_33)) != apply(Y_33,apply(apply(b,combinator),Y_33)) ),
inference(superposition,[status(thm),theory(equality)],[c_855,c_8]) ).
tff(c_1164,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_953]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : COL021-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % 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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 18:26:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.50/2.53 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.50/2.53
% 4.50/2.53 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.50/2.57
% 4.50/2.57 Inference rules
% 4.50/2.57 ----------------------
% 4.50/2.57 #Ref : 1
% 4.50/2.57 #Sup : 277
% 4.50/2.57 #Fact : 0
% 4.50/2.57 #Define : 0
% 4.50/2.57 #Split : 0
% 4.50/2.57 #Chain : 0
% 4.50/2.57 #Close : 0
% 4.50/2.57
% 4.50/2.57 Ordering : KBO
% 4.50/2.57
% 4.50/2.57 Simplification rules
% 4.50/2.57 ----------------------
% 4.50/2.57 #Subsume : 8
% 4.50/2.57 #Demod : 181
% 4.50/2.57 #Tautology : 76
% 4.50/2.57 #SimpNegUnit : 0
% 4.50/2.57 #BackRed : 0
% 4.50/2.57
% 4.50/2.57 #Partial instantiations: 0
% 4.50/2.57 #Strategies tried : 1
% 4.50/2.57
% 4.50/2.57 Timing (in seconds)
% 4.50/2.57 ----------------------
% 4.50/2.57 Preprocessing : 0.51
% 4.50/2.57 Parsing : 0.27
% 4.50/2.57 CNF conversion : 0.03
% 4.50/2.57 Main loop : 0.80
% 4.50/2.57 Inferencing : 0.30
% 4.50/2.57 Reduction : 0.30
% 4.50/2.57 Demodulation : 0.26
% 4.50/2.57 BG Simplification : 0.04
% 4.50/2.57 Subsumption : 0.12
% 4.50/2.57 Abstraction : 0.04
% 4.50/2.57 MUC search : 0.00
% 4.50/2.57 Cooper : 0.00
% 4.50/2.57 Total : 1.37
% 4.50/2.57 Index Insertion : 0.00
% 4.50/2.57 Index Deletion : 0.00
% 4.50/2.57 Index Matching : 0.00
% 4.50/2.57 BG Taut test : 0.00
%------------------------------------------------------------------------------