TSTP Solution File: COL075-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL075-2 : 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 : n014.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 3.17s 1.82s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 11 unt; 5 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 : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > c > b > k > 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(abstraction,type,
abstraction: $i ).
tff(f_30,axiom,
! [X,Y] : ( apply(apply(k,X),Y) = X ),
file(unknown,unknown) ).
tff(f_36,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_40,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_4,plain,
! [X_3,Z_5,Y_4] : ( apply(apply(X_3,apply(k,Z_5)),apply(Y_4,Z_5)) = apply(apply(apply(abstraction,X_3),Y_4),Z_5) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_26,plain,
! [X_11,Z_12,Y_13] : ( apply(apply(X_11,apply(k,Z_12)),apply(Y_13,Z_12)) = apply(apply(apply(abstraction,X_11),Y_13),Z_12) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_281,plain,
! [X_29,X_30,Y_31] : ( apply(apply(apply(abstraction,X_29),apply(k,X_30)),Y_31) = apply(apply(X_29,apply(k,Y_31)),X_30) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_26]) ).
tff(c_354,plain,
! [Z_5,Y_31] : ( apply(apply(apply(k,Z_5),apply(k,Y_31)),Z_5) = apply(apply(apply(apply(abstraction,abstraction),k),Z_5),Y_31) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_281]) ).
tff(c_370,plain,
! [Z_32,Y_33] : ( apply(apply(apply(apply(abstraction,abstraction),k),Z_32),Y_33) = apply(Z_32,Z_32) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_354]) ).
tff(c_6,plain,
! [Y_6] : ( apply(apply(Y_6,b(Y_6)),c(Y_6)) != apply(b(Y_6),b(Y_6)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_512,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_370,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL075-2 : 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.14/0.35 % Computer : n014.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:09:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.17/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.17/1.82
% 3.17/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.38/1.86
% 3.38/1.86 Inference rules
% 3.38/1.86 ----------------------
% 3.38/1.86 #Ref : 0
% 3.38/1.86 #Sup : 119
% 3.38/1.86 #Fact : 0
% 3.38/1.86 #Define : 0
% 3.38/1.86 #Split : 0
% 3.38/1.86 #Chain : 0
% 3.38/1.86 #Close : 0
% 3.38/1.86
% 3.38/1.86 Ordering : KBO
% 3.38/1.86
% 3.38/1.86 Simplification rules
% 3.38/1.86 ----------------------
% 3.38/1.86 #Subsume : 0
% 3.38/1.86 #Demod : 38
% 3.38/1.86 #Tautology : 31
% 3.38/1.86 #SimpNegUnit : 0
% 3.38/1.86 #BackRed : 0
% 3.38/1.86
% 3.38/1.86 #Partial instantiations: 0
% 3.38/1.86 #Strategies tried : 1
% 3.38/1.86
% 3.38/1.86 Timing (in seconds)
% 3.38/1.86 ----------------------
% 3.38/1.86 Preprocessing : 0.40
% 3.38/1.86 Parsing : 0.21
% 3.38/1.86 CNF conversion : 0.02
% 3.38/1.86 Main loop : 0.37
% 3.38/1.86 Inferencing : 0.15
% 3.38/1.86 Reduction : 0.12
% 3.38/1.86 Demodulation : 0.10
% 3.38/1.86 BG Simplification : 0.02
% 3.38/1.86 Subsumption : 0.07
% 3.38/1.86 Abstraction : 0.02
% 3.38/1.86 MUC search : 0.00
% 3.38/1.86 Cooper : 0.00
% 3.38/1.86 Total : 0.83
% 3.38/1.86 Index Insertion : 0.00
% 3.38/1.86 Index Deletion : 0.00
% 3.38/1.86 Index Matching : 0.00
% 3.38/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------