TSTP Solution File: COL001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL001-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 : n020.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 31.42s 17.31s
% Output : CNFRefutation 31.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 17 ( 13 unt; 4 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > s > k > combinator
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(s,type,
s: $i ).
tff(k,type,
k: $i ).
tff(combinator,type,
combinator: $i ).
tff(f_27,axiom,
! [X,Y,Z] : ( apply(apply(apply(s,X),Y),Z) = apply(apply(X,Z),apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [X,Y] : ( apply(apply(k,X),Y) = X ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_17,plain,
! [X_10,Y_11,Z_12] : ( apply(apply(apply(s,X_10),Y_11),Z_12) = apply(apply(X_10,Z_12),apply(Y_11,Z_12)) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
! [X_4,Y_5] : ( apply(apply(k,X_4),Y_5) = X_4 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_43,plain,
! [Y_11,Z_12] : ( apply(apply(apply(s,k),Y_11),Z_12) = Z_12 ),
inference(superposition,[status(thm),theory(equality)],[c_17,c_4]) ).
tff(c_206,plain,
! [X_20,Y_21,Y_22] : ( apply(apply(apply(s,apply(k,X_20)),Y_21),Y_22) = apply(X_20,apply(Y_21,Y_22)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_17]) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( apply(apply(apply(s,X_1),Y_2),Z_3) = apply(apply(X_1,Z_3),apply(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_6718,plain,
! [X_88,Y_89,Y_90] : ( apply(apply(apply(s,apply(s,apply(k,X_88))),Y_89),Y_90) = apply(X_88,apply(Y_90,apply(Y_89,Y_90))) ),
inference(superposition,[status(thm),theory(equality)],[c_206,c_2]) ).
tff(c_6,plain,
! [Y_6] : ( apply(combinator,Y_6) != Y_6 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_11171,plain,
! [Y_118,Y_119] : ( apply(apply(apply(s,apply(s,apply(k,combinator))),Y_118),Y_119) != apply(Y_119,apply(Y_118,Y_119)) ),
inference(superposition,[status(thm),theory(equality)],[c_6718,c_6]) ).
tff(c_11527,plain,
! [Y_11,Z_12] : ( apply(apply(apply(s,apply(s,apply(k,combinator))),apply(apply(s,k),Y_11)),Z_12) != apply(Z_12,Z_12) ),
inference(superposition,[status(thm),theory(equality)],[c_43,c_11171]) ).
tff(c_58355,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_11527]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : COL001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.16 % 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.16/0.37 % Computer : n020.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 3 18:14:37 EDT 2023
% 0.16/0.37 % CPUTime :
% 31.42/17.31 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.42/17.31
% 31.42/17.31 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 31.42/17.33
% 31.42/17.33 Inference rules
% 31.42/17.33 ----------------------
% 31.42/17.33 #Ref : 1
% 31.42/17.33 #Sup : 15357
% 31.42/17.33 #Fact : 0
% 31.42/17.33 #Define : 0
% 31.42/17.33 #Split : 0
% 31.42/17.33 #Chain : 0
% 31.42/17.33 #Close : 0
% 31.42/17.33
% 31.42/17.33 Ordering : KBO
% 31.42/17.33
% 31.42/17.33 Simplification rules
% 31.42/17.33 ----------------------
% 31.42/17.33 #Subsume : 620
% 31.42/17.33 #Demod : 4838
% 31.42/17.33 #Tautology : 1647
% 31.42/17.33 #SimpNegUnit : 0
% 31.42/17.33 #BackRed : 0
% 31.42/17.33
% 31.42/17.33 #Partial instantiations: 0
% 31.42/17.33 #Strategies tried : 1
% 31.42/17.33
% 31.42/17.33 Timing (in seconds)
% 31.42/17.33 ----------------------
% 31.42/17.34 Preprocessing : 0.40
% 31.42/17.34 Parsing : 0.22
% 31.42/17.34 CNF conversion : 0.02
% 31.42/17.34 Main loop : 15.84
% 31.42/17.34 Inferencing : 2.42
% 31.42/17.34 Reduction : 11.04
% 31.42/17.34 Demodulation : 10.71
% 31.42/17.34 BG Simplification : 0.37
% 31.42/17.34 Subsumption : 1.68
% 31.42/17.34 Abstraction : 0.55
% 31.42/17.34 MUC search : 0.00
% 31.42/17.34 Cooper : 0.00
% 31.42/17.34 Total : 16.28
% 31.42/17.34 Index Insertion : 0.00
% 31.42/17.34 Index Deletion : 0.00
% 31.42/17.34 Index Matching : 0.00
% 31.42/17.34 BG Taut test : 0.00
%------------------------------------------------------------------------------