TSTP Solution File: COL025-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL025-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 : n013.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 2.85s 1.73s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 9 ( 8 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 : 4 ( 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 : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > w > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(w,type,
w: $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(f_29,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] : ( apply(apply(w,X),Y) = apply(apply(X,Y),Y) ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
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_29]) ).
tff(c_4,plain,
! [X_4,Y_5] : ( apply(apply(w,X_4),Y_5) = apply(apply(X_4,Y_5),Y_5) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_126,plain,
! [X_14,Z_15] : ( apply(apply(w,apply(b,X_14)),Z_15) = apply(X_14,apply(Z_15,Z_15)) ),
inference(superposition,[status(thm),theory(equality)],[c_90,c_4]) ).
tff(c_6,plain,
! [Y_6] : ( apply(combinator,Y_6) != Y_6 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_186,plain,
! [Z_15] : ( apply(apply(w,apply(b,combinator)),Z_15) != apply(Z_15,Z_15) ),
inference(superposition,[status(thm),theory(equality)],[c_126,c_6]) ).
tff(c_236,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : COL025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.37 % Computer : n013.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 18:11:02 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.85/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.85/1.73
% 2.85/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.85/1.75
% 2.85/1.75 Inference rules
% 2.85/1.75 ----------------------
% 2.85/1.75 #Ref : 1
% 2.85/1.75 #Sup : 58
% 2.85/1.75 #Fact : 0
% 2.85/1.75 #Define : 0
% 2.85/1.75 #Split : 0
% 2.85/1.75 #Chain : 0
% 2.85/1.75 #Close : 0
% 2.85/1.75
% 2.85/1.75 Ordering : KBO
% 2.85/1.75
% 2.85/1.75 Simplification rules
% 2.85/1.75 ----------------------
% 2.85/1.75 #Subsume : 7
% 2.85/1.75 #Demod : 0
% 2.85/1.75 #Tautology : 14
% 2.85/1.75 #SimpNegUnit : 0
% 2.85/1.75 #BackRed : 0
% 2.85/1.75
% 2.85/1.75 #Partial instantiations: 0
% 2.85/1.75 #Strategies tried : 1
% 2.85/1.75
% 2.85/1.75 Timing (in seconds)
% 2.85/1.75 ----------------------
% 2.85/1.75 Preprocessing : 0.39
% 2.85/1.75 Parsing : 0.21
% 2.85/1.75 CNF conversion : 0.02
% 2.85/1.75 Main loop : 0.29
% 2.85/1.75 Inferencing : 0.12
% 2.85/1.76 Reduction : 0.08
% 2.85/1.76 Demodulation : 0.07
% 2.85/1.76 BG Simplification : 0.02
% 2.85/1.76 Subsumption : 0.05
% 2.85/1.76 Abstraction : 0.02
% 2.85/1.76 MUC search : 0.00
% 2.85/1.76 Cooper : 0.00
% 2.85/1.76 Total : 0.72
% 2.85/1.76 Index Insertion : 0.00
% 2.85/1.76 Index Deletion : 0.00
% 2.85/1.76 Index Matching : 0.00
% 2.85/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------