TSTP Solution File: COL048-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL048-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 : n028.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:54 EDT 2023
% Result : Unsatisfiable 3.44s 1.84s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 14 ( 9 unt; 5 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > w > m > combinator > b
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(w,type,
w: $i ).
tff(combinator,type,
combinator: $i ).
tff(b,type,
b: $i ).
tff(f_30,axiom,
! [X,Y] : ( apply(apply(w,X),Y) = apply(apply(X,Y),Y) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [X,Y,Z] : ( apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [Y] : ( Y != apply(combinator,Y) ),
file(unknown,unknown) ).
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_30]) ).
tff(c_119,plain,
! [X_13,Y_14,Z_15] : ( apply(apply(apply(b,X_13),Y_14),Z_15) = apply(X_13,apply(Y_14,Z_15)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_469,plain,
! [X_21,Y_22] : ( apply(apply(w,apply(b,X_21)),Y_22) = apply(X_21,apply(Y_22,Y_22)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_119]) ).
tff(c_8,plain,
! [Y_7] : ( apply(combinator,Y_7) != Y_7 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_577,plain,
! [Y_22] : ( apply(apply(w,apply(b,combinator)),Y_22) != apply(Y_22,Y_22) ),
inference(superposition,[status(thm),theory(equality)],[c_469,c_8]) ).
tff(c_797,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_577]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL048-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % 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.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:23:54 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.44/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.44/1.84
% 3.44/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.86
% 3.62/1.86 Inference rules
% 3.62/1.86 ----------------------
% 3.62/1.86 #Ref : 1
% 3.62/1.86 #Sup : 189
% 3.62/1.86 #Fact : 0
% 3.62/1.86 #Define : 0
% 3.62/1.86 #Split : 0
% 3.62/1.86 #Chain : 0
% 3.62/1.86 #Close : 0
% 3.62/1.86
% 3.62/1.86 Ordering : KBO
% 3.62/1.86
% 3.62/1.86 Simplification rules
% 3.62/1.86 ----------------------
% 3.62/1.86 #Subsume : 22
% 3.62/1.86 #Demod : 83
% 3.62/1.86 #Tautology : 65
% 3.62/1.86 #SimpNegUnit : 0
% 3.62/1.86 #BackRed : 0
% 3.62/1.86
% 3.62/1.86 #Partial instantiations: 0
% 3.62/1.86 #Strategies tried : 1
% 3.62/1.86
% 3.62/1.86 Timing (in seconds)
% 3.62/1.86 ----------------------
% 3.62/1.87 Preprocessing : 0.39
% 3.62/1.87 Parsing : 0.21
% 3.62/1.87 CNF conversion : 0.02
% 3.62/1.87 Main loop : 0.49
% 3.62/1.87 Inferencing : 0.18
% 3.62/1.87 Reduction : 0.18
% 3.62/1.87 Demodulation : 0.15
% 3.62/1.87 BG Simplification : 0.02
% 3.62/1.87 Subsumption : 0.07
% 3.62/1.87 Abstraction : 0.03
% 3.62/1.87 MUC search : 0.00
% 3.62/1.87 Cooper : 0.00
% 3.62/1.87 Total : 0.91
% 3.62/1.87 Index Insertion : 0.00
% 3.62/1.87 Index Deletion : 0.00
% 3.62/1.87 Index Matching : 0.00
% 3.62/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------