TSTP Solution File: COL029-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL029-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/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 : n010.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 1.92s 1.54s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 9 ( 6 unt; 3 typ; 0 def)
% Number of atoms : 6 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > f > u
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(u,type,
u: $i ).
tff(f,type,
f: $i > $i ).
tff(f_29,axiom,
! [X,Y] : ( apply(apply(u,X),Y) = apply(Y,apply(apply(X,X),Y)) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [Y] : ( apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [Y_5,X_6] : ( apply(Y_5,apply(apply(X_6,X_6),Y_5)) = apply(apply(u,X_6),Y_5) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_4,plain,
! [Y_3] : ( apply(f(Y_3),apply(Y_3,f(Y_3))) != apply(Y_3,f(Y_3)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_17,plain,
! [X_6] : ( apply(apply(u,X_6),f(apply(X_6,X_6))) != apply(apply(X_6,X_6),f(apply(X_6,X_6))) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_4]) ).
tff(c_30,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL029-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/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.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:05:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 1.92/1.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.92/1.54
% 1.92/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.15/1.57
% 2.15/1.57 Inference rules
% 2.15/1.57 ----------------------
% 2.15/1.57 #Ref : 1
% 2.15/1.57 #Sup : 5
% 2.15/1.57 #Fact : 0
% 2.15/1.57 #Define : 0
% 2.15/1.57 #Split : 0
% 2.15/1.57 #Chain : 0
% 2.15/1.58 #Close : 0
% 2.15/1.58
% 2.15/1.58 Ordering : KBO
% 2.15/1.58
% 2.15/1.58 Simplification rules
% 2.15/1.58 ----------------------
% 2.15/1.58 #Subsume : 0
% 2.15/1.58 #Demod : 0
% 2.15/1.58 #Tautology : 2
% 2.15/1.58 #SimpNegUnit : 0
% 2.15/1.58 #BackRed : 0
% 2.15/1.58
% 2.15/1.58 #Partial instantiations: 0
% 2.15/1.58 #Strategies tried : 1
% 2.15/1.58
% 2.15/1.58 Timing (in seconds)
% 2.15/1.58 ----------------------
% 2.15/1.58 Preprocessing : 0.37
% 2.15/1.58 Parsing : 0.20
% 2.15/1.58 CNF conversion : 0.02
% 2.15/1.58 Main loop : 0.13
% 2.15/1.58 Inferencing : 0.06
% 2.15/1.58 Reduction : 0.03
% 2.15/1.58 Demodulation : 0.02
% 2.15/1.58 BG Simplification : 0.01
% 2.15/1.58 Subsumption : 0.03
% 2.15/1.58 Abstraction : 0.01
% 2.15/1.58 MUC search : 0.00
% 2.15/1.58 Cooper : 0.00
% 2.15/1.58 Total : 0.55
% 2.15/1.58 Index Insertion : 0.00
% 2.15/1.58 Index Deletion : 0.00
% 2.15/1.58 Index Matching : 0.00
% 2.15/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------