TSTP Solution File: COL045-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL045-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 : n011.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:54 EDT 2023
% Result : Unsatisfiable 8.83s 3.20s
% Output : CNFRefutation 8.83s
% 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 > s > m > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(s,type,
s: $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(f_30,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_32,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_30]) ).
tff(c_6,plain,
! [X_7] : ( apply(m,X_7) = apply(X_7,X_7) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_7808,plain,
! [X_67,Y_68] : ( apply(X_67,apply(Y_68,apply(apply(b,X_67),Y_68))) = apply(m,apply(apply(b,X_67),Y_68)) ),
inference(superposition,[status(thm),theory(equality)],[c_27,c_6]) ).
tff(c_8,plain,
! [Y_8] : ( apply(combinator,Y_8) != Y_8 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8056,plain,
! [Y_68] : ( apply(m,apply(apply(b,combinator),Y_68)) != apply(Y_68,apply(apply(b,combinator),Y_68)) ),
inference(superposition,[status(thm),theory(equality)],[c_7808,c_8]) ).
tff(c_8225,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_8056]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : COL045-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/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 : n011.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:15:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.83/3.20 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.83/3.20
% 8.83/3.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.83/3.23
% 8.83/3.23 Inference rules
% 8.83/3.23 ----------------------
% 8.83/3.23 #Ref : 1
% 8.83/3.23 #Sup : 2015
% 8.83/3.23 #Fact : 0
% 8.83/3.23 #Define : 0
% 8.83/3.23 #Split : 0
% 8.83/3.23 #Chain : 0
% 8.83/3.23 #Close : 0
% 8.83/3.23
% 8.83/3.23 Ordering : KBO
% 8.83/3.23
% 8.83/3.23 Simplification rules
% 8.83/3.23 ----------------------
% 8.83/3.23 #Subsume : 196
% 8.83/3.23 #Demod : 1439
% 8.83/3.23 #Tautology : 512
% 8.83/3.23 #SimpNegUnit : 0
% 8.83/3.23 #BackRed : 0
% 8.83/3.23
% 8.83/3.23 #Partial instantiations: 0
% 8.83/3.23 #Strategies tried : 1
% 8.83/3.23
% 8.83/3.23 Timing (in seconds)
% 8.83/3.23 ----------------------
% 8.83/3.23 Preprocessing : 0.38
% 8.83/3.23 Parsing : 0.20
% 8.83/3.23 CNF conversion : 0.02
% 8.83/3.23 Main loop : 1.78
% 8.83/3.23 Inferencing : 0.50
% 8.83/3.23 Reduction : 0.93
% 8.83/3.23 Demodulation : 0.85
% 8.83/3.23 BG Simplification : 0.08
% 8.83/3.23 Subsumption : 0.20
% 8.83/3.23 Abstraction : 0.09
% 8.83/3.23 MUC search : 0.00
% 8.83/3.23 Cooper : 0.00
% 8.83/3.23 Total : 2.20
% 8.83/3.23 Index Insertion : 0.00
% 8.83/3.23 Index Deletion : 0.00
% 8.83/3.23 Index Matching : 0.00
% 8.83/3.23 BG Taut test : 0.00
%------------------------------------------------------------------------------