TSTP Solution File: COL032-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COL032-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 : 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:34:51 EDT 2023
% Result : Unsatisfiable 21.99s 11.04s
% Output : CNFRefutation 21.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 16 ( 12 unt; 4 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ apply > #nlpp > f > q > m
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(apply,type,
apply: ( $i * $i ) > $i ).
tff(f,type,
f: $i > $i ).
tff(q,type,
q: $i ).
tff(f_28,axiom,
! [X] : ( apply(m,X) = apply(X,X) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [X,Y,Z] : ( apply(apply(apply(q,X),Y),Z) = apply(Y,apply(X,Z)) ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [Y] : ( apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))) ),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : ( apply(m,X_1) = apply(X_1,X_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_25,plain,
! [X_8,Y_9,Z_10] : ( apply(apply(apply(q,X_8),Y_9),Z_10) = apply(Y_9,apply(X_8,Z_10)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_51,plain,
! [Y_9,X_8] : ( apply(Y_9,apply(X_8,apply(apply(q,X_8),Y_9))) = apply(m,apply(apply(q,X_8),Y_9)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_25]) ).
tff(c_4,plain,
! [X_2,Y_3,Z_4] : ( apply(apply(apply(q,X_2),Y_3),Z_4) = apply(Y_3,apply(X_2,Z_4)) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
! [Y_5] : ( apply(f(Y_5),apply(Y_5,f(Y_5))) != apply(Y_5,f(Y_5)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_32,plain,
! [X_8,Y_9] : ( apply(f(apply(apply(q,X_8),Y_9)),apply(Y_9,apply(X_8,f(apply(apply(q,X_8),Y_9))))) != apply(apply(apply(q,X_8),Y_9),f(apply(apply(q,X_8),Y_9))) ),
inference(superposition,[status(thm),theory(equality)],[c_25,c_6]) ).
tff(c_840,plain,
! [X_26,Y_27] : ( apply(f(apply(apply(q,X_26),Y_27)),apply(Y_27,apply(X_26,f(apply(apply(q,X_26),Y_27))))) != apply(Y_27,apply(X_26,f(apply(apply(q,X_26),Y_27)))) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_32]) ).
tff(c_912,plain,
! [X_8] : ( apply(m,apply(apply(q,X_8),f(apply(apply(q,apply(q,X_8)),X_8)))) != apply(X_8,apply(apply(q,X_8),f(apply(apply(q,apply(q,X_8)),X_8)))) ),
inference(superposition,[status(thm),theory(equality)],[c_51,c_840]) ).
tff(c_31541,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_912]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL032-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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:19 EDT 2023
% 0.13/0.35 % CPUTime :
% 21.99/11.04 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.99/11.04
% 21.99/11.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.99/11.07
% 21.99/11.07 Inference rules
% 21.99/11.07 ----------------------
% 21.99/11.07 #Ref : 1
% 21.99/11.07 #Sup : 7359
% 21.99/11.07 #Fact : 0
% 21.99/11.07 #Define : 0
% 21.99/11.07 #Split : 0
% 21.99/11.07 #Chain : 0
% 21.99/11.07 #Close : 0
% 21.99/11.07
% 21.99/11.07 Ordering : KBO
% 21.99/11.07
% 21.99/11.07 Simplification rules
% 21.99/11.07 ----------------------
% 21.99/11.07 #Subsume : 282
% 21.99/11.07 #Demod : 10301
% 21.99/11.07 #Tautology : 2015
% 21.99/11.07 #SimpNegUnit : 0
% 21.99/11.07 #BackRed : 0
% 21.99/11.07
% 21.99/11.07 #Partial instantiations: 0
% 21.99/11.07 #Strategies tried : 1
% 21.99/11.07
% 21.99/11.07 Timing (in seconds)
% 21.99/11.07 ----------------------
% 21.99/11.07 Preprocessing : 0.40
% 21.99/11.07 Parsing : 0.22
% 21.99/11.07 CNF conversion : 0.02
% 21.99/11.07 Main loop : 9.58
% 21.99/11.07 Inferencing : 1.28
% 21.99/11.07 Reduction : 7.15
% 21.99/11.07 Demodulation : 6.89
% 21.99/11.07 BG Simplification : 0.18
% 21.99/11.07 Subsumption : 0.76
% 21.99/11.07 Abstraction : 0.37
% 21.99/11.07 MUC search : 0.00
% 21.99/11.07 Cooper : 0.00
% 21.99/11.07 Total : 10.02
% 21.99/11.07 Index Insertion : 0.00
% 21.99/11.07 Index Deletion : 0.00
% 21.99/11.07 Index Matching : 0.00
% 21.99/11.07 BG Taut test : 0.00
%------------------------------------------------------------------------------