TSTP Solution File: COL001-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL001-2 : 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 : 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:46 EDT 2023
% Result : Unsatisfiable 6.50s 2.85s
% Output : CNFRefutation 7.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 19 ( 12 unt; 7 typ; 0 def)
% Number of atoms : 12 ( 11 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > x > s > k > i > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i ).
tff(x,type,
x: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(s,type,
s: $i ).
tff(k,type,
k: $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(f_32,axiom,
! [X] : ( apply(i,X) = X ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X,Y,Z] : ( apply(apply(apply(s,X),Y),Z) = apply(apply(X,Z),apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_8,plain,
! [X_9] : ( apply(i,X_9) = X_9 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_41,plain,
! [X_19,Y_20,Z_21] : ( apply(apply(apply(s,X_19),Y_20),Z_21) = apply(apply(X_19,Z_21),apply(Y_20,Z_21)) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_176,plain,
! [X_25,X_26] : ( apply(apply(apply(s,X_25),i),X_26) = apply(apply(X_25,X_26),X_26) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_41]) ).
tff(c_6,plain,
! [X_6,Y_7,Z_8] : ( apply(apply(apply(b,X_6),Y_7),Z_8) = apply(X_6,apply(Y_7,Z_8)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_4583,plain,
! [X_79,X_80] : ( apply(apply(apply(s,apply(b,X_79)),i),X_80) = apply(X_79,apply(X_80,X_80)) ),
inference(superposition,[status(thm),theory(equality)],[c_176,c_6]) ).
tff(c_12,plain,
! [Y_11] : ( apply(combinator,Y_11) != Y_11 ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_4962,plain,
! [X_80] : ( apply(apply(apply(s,apply(b,combinator)),i),X_80) != apply(X_80,X_80) ),
inference(superposition,[status(thm),theory(equality)],[c_4583,c_12]) ).
tff(c_5710,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_4962]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.14/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.35 % Computer : n005.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:11:26 EDT 2023
% 0.14/0.36 % CPUTime :
% 6.50/2.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.50/2.86
% 6.50/2.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.18/2.88
% 7.18/2.88 Inference rules
% 7.18/2.88 ----------------------
% 7.18/2.88 #Ref : 1
% 7.18/2.88 #Sup : 1476
% 7.18/2.88 #Fact : 0
% 7.18/2.88 #Define : 0
% 7.18/2.88 #Split : 0
% 7.18/2.88 #Chain : 0
% 7.18/2.88 #Close : 0
% 7.18/2.88
% 7.18/2.88 Ordering : KBO
% 7.18/2.88
% 7.18/2.88 Simplification rules
% 7.18/2.88 ----------------------
% 7.18/2.88 #Subsume : 6
% 7.18/2.88 #Demod : 297
% 7.18/2.88 #Tautology : 260
% 7.18/2.88 #SimpNegUnit : 0
% 7.18/2.88 #BackRed : 1
% 7.18/2.88
% 7.18/2.88 #Partial instantiations: 0
% 7.18/2.88 #Strategies tried : 1
% 7.18/2.88
% 7.18/2.88 Timing (in seconds)
% 7.18/2.88 ----------------------
% 7.18/2.89 Preprocessing : 0.42
% 7.18/2.89 Parsing : 0.22
% 7.18/2.89 CNF conversion : 0.02
% 7.18/2.89 Main loop : 1.33
% 7.18/2.89 Inferencing : 0.46
% 7.18/2.89 Reduction : 0.55
% 7.18/2.89 Demodulation : 0.48
% 7.18/2.89 BG Simplification : 0.07
% 7.18/2.89 Subsumption : 0.19
% 7.18/2.89 Abstraction : 0.08
% 7.18/2.89 MUC search : 0.00
% 7.18/2.89 Cooper : 0.00
% 7.18/2.89 Total : 1.80
% 7.18/2.89 Index Insertion : 0.00
% 7.18/2.89 Index Deletion : 0.00
% 7.18/2.89 Index Matching : 0.00
% 7.18/2.89 BG Taut test : 0.00
%------------------------------------------------------------------------------