TSTP Solution File: COL026-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL026-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 : n032.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:51 EDT 2023
% Result : Unsatisfiable 6.30s 2.72s
% Output : CNFRefutation 6.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 11 ( 10 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > w1 > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(w1,type,
w1: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $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,Y] : ( apply(apply(w1,X),Y) = apply(apply(Y,X),X) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( apply(apply(apply(b,X_1),Y_2),Z_3) = apply(X_1,apply(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_90,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,Y_5] : ( apply(apply(w1,X_4),Y_5) = apply(apply(Y_5,X_4),X_4) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_941,plain,
! [Z_26,X_27,Y_28] : ( apply(apply(w1,Z_26),apply(apply(b,X_27),Y_28)) = apply(apply(X_27,apply(Y_28,Z_26)),Z_26) ),
inference(superposition,[status(thm),theory(equality)],[c_90,c_4]) ).
tff(c_3502,plain,
! [Z_46,X_47,Y_48] : ( apply(apply(w1,Z_46),apply(apply(b,apply(b,X_47)),Y_48)) = apply(X_47,apply(apply(Y_48,Z_46),Z_46)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_941]) ).
tff(c_6,plain,
! [Y_6] : ( apply(combinator,Y_6) != Y_6 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_3830,plain,
! [Z_46,Y_48] : ( apply(apply(w1,Z_46),apply(apply(b,apply(b,combinator)),Y_48)) != apply(apply(Y_48,Z_46),Z_46) ),
inference(superposition,[status(thm),theory(equality)],[c_3502,c_6]) ).
tff(c_4213,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_3830]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COL026-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % 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.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Thu Aug 3 18:17:06 EDT 2023
% 0.12/0.31 % CPUTime :
% 6.30/2.72 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.30/2.72
% 6.30/2.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.30/2.74
% 6.30/2.74 Inference rules
% 6.30/2.74 ----------------------
% 6.30/2.74 #Ref : 1
% 6.30/2.74 #Sup : 1045
% 6.30/2.74 #Fact : 0
% 6.30/2.74 #Define : 0
% 6.30/2.74 #Split : 0
% 6.30/2.74 #Chain : 0
% 6.30/2.74 #Close : 0
% 6.30/2.74
% 6.30/2.74 Ordering : KBO
% 6.30/2.74
% 6.30/2.74 Simplification rules
% 6.30/2.74 ----------------------
% 6.30/2.74 #Subsume : 59
% 6.30/2.74 #Demod : 559
% 6.30/2.74 #Tautology : 161
% 6.30/2.74 #SimpNegUnit : 0
% 6.30/2.74 #BackRed : 0
% 6.30/2.74
% 6.30/2.74 #Partial instantiations: 0
% 6.30/2.74 #Strategies tried : 1
% 6.30/2.74
% 6.30/2.74 Timing (in seconds)
% 6.30/2.74 ----------------------
% 7.02/2.75 Preprocessing : 0.38
% 7.02/2.75 Parsing : 0.20
% 7.02/2.75 CNF conversion : 0.02
% 7.02/2.75 Main loop : 1.34
% 7.02/2.75 Inferencing : 0.43
% 7.02/2.75 Reduction : 0.64
% 7.02/2.75 Demodulation : 0.57
% 7.02/2.75 BG Simplification : 0.06
% 7.02/2.75 Subsumption : 0.15
% 7.02/2.75 Abstraction : 0.07
% 7.02/2.75 MUC search : 0.00
% 7.02/2.75 Cooper : 0.00
% 7.02/2.75 Total : 1.77
% 7.02/2.75 Index Insertion : 0.00
% 7.02/2.75 Index Deletion : 0.00
% 7.02/2.75 Index Matching : 0.00
% 7.02/2.75 BG Taut test : 0.00
%------------------------------------------------------------------------------