TSTP Solution File: COL075-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL075-1 : TPTP v8.1.2. Released v1.2.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 : n008.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:35:00 EDT 2023
% Result : Unsatisfiable 14.08s 4.73s
% Output : CNFRefutation 14.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 21 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair > n > apply > #nlpp > c > b > projection2 > projection1 > k > eq > abstraction
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(b,type,
b: $i > $i ).
tff(c,type,
c: $i > $i ).
tff(k,type,
k: $i ).
tff(eq,type,
eq: $i ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(projection1,type,
projection1: $i ).
tff(abstraction,type,
abstraction: $i ).
tff(n,type,
n: ( $i * $i ) > $i ).
tff(projection2,type,
projection2: $i ).
tff(f_30,axiom,
! [X,Y] : ( apply(apply(k,X),Y) = X ),
file(unknown,unknown) ).
tff(f_44,axiom,
! [X,Y,Z] : ( apply(apply(apply(abstraction,X),Y),Z) = apply(apply(X,apply(k,Z)),apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_61,axiom,
! [Y] : ( apply(apply(Y,b(Y)),c(Y)) != apply(b(Y),b(Y)) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2] : ( apply(apply(k,X_1),Y_2) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_12,plain,
! [X_11,Z_13,Y_12] : ( apply(apply(X_11,apply(k,Z_13)),apply(Y_12,Z_13)) = apply(apply(apply(abstraction,X_11),Y_12),Z_13) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_420,plain,
! [X_50,Z_51,Y_52] : ( apply(apply(X_50,apply(k,Z_51)),apply(Y_52,Z_51)) = apply(apply(apply(abstraction,X_50),Y_52),Z_51) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_7060,plain,
! [X_157,X_158,Y_159] : ( apply(apply(apply(abstraction,X_157),apply(k,X_158)),Y_159) = apply(apply(X_157,apply(k,Y_159)),X_158) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_420]) ).
tff(c_7209,plain,
! [Z_13,Y_159] : ( apply(apply(apply(k,Z_13),apply(k,Y_159)),Z_13) = apply(apply(apply(apply(abstraction,abstraction),k),Z_13),Y_159) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_7060]) ).
tff(c_17778,plain,
! [Z_242,Y_243] : ( apply(apply(apply(apply(abstraction,abstraction),k),Z_242),Y_243) = apply(Z_242,Z_242) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_7209]) ).
tff(c_22,plain,
! [Y_19] : ( apply(apply(Y_19,b(Y_19)),c(Y_19)) != apply(b(Y_19),b(Y_19)) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_18277,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_17778,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL075-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/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.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:15:34 EDT 2023
% 0.20/0.35 % CPUTime :
% 14.08/4.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.08/4.73
% 14.08/4.73 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.08/4.76
% 14.08/4.76 Inference rules
% 14.08/4.76 ----------------------
% 14.08/4.76 #Ref : 1
% 14.08/4.76 #Sup : 4814
% 14.08/4.76 #Fact : 1
% 14.08/4.76 #Define : 0
% 14.08/4.76 #Split : 4
% 14.08/4.76 #Chain : 0
% 14.08/4.76 #Close : 0
% 14.08/4.76
% 14.08/4.76 Ordering : KBO
% 14.08/4.76
% 14.08/4.76 Simplification rules
% 14.08/4.76 ----------------------
% 14.08/4.76 #Subsume : 157
% 14.08/4.76 #Demod : 2148
% 14.08/4.76 #Tautology : 1441
% 14.08/4.76 #SimpNegUnit : 226
% 14.08/4.76 #BackRed : 0
% 14.08/4.76
% 14.08/4.76 #Partial instantiations: 0
% 14.08/4.76 #Strategies tried : 1
% 14.08/4.76
% 14.08/4.76 Timing (in seconds)
% 14.08/4.76 ----------------------
% 14.08/4.76 Preprocessing : 0.43
% 14.08/4.76 Parsing : 0.23
% 14.08/4.76 CNF conversion : 0.02
% 14.08/4.76 Main loop : 3.29
% 14.08/4.76 Inferencing : 0.79
% 14.08/4.76 Reduction : 1.57
% 14.08/4.76 Demodulation : 1.37
% 14.08/4.76 BG Simplification : 0.10
% 14.08/4.76 Subsumption : 0.64
% 14.08/4.76 Abstraction : 0.12
% 14.08/4.76 MUC search : 0.00
% 14.08/4.76 Cooper : 0.00
% 14.08/4.76 Total : 3.76
% 14.08/4.76 Index Insertion : 0.00
% 14.08/4.76 Index Deletion : 0.00
% 14.08/4.76 Index Matching : 0.00
% 14.08/4.76 BG Taut test : 0.00
%------------------------------------------------------------------------------