TSTP Solution File: SYO691-1.000 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYO691-1.000 : TPTP v8.1.2. Released v7.3.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 : n017.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 11:18:22 EDT 2023
% Result : Unsatisfiable 2.71s 1.62s
% Output : CNFRefutation 2.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 47 ( 26 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 74 (; 74 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ seq > top > step > f > #nlpp > succ > zero > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(top,type,
top: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(step,type,
step: ( $i * $i ) > $o ).
tff(succ,type,
succ: $i > $i ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(zero,type,
zero: $i ).
tff(seq,type,
seq: ( $i * $i * $i ) > $o ).
tff(f_23,axiom,
! [Z,Y,X] : top(f(f(Z,Y),f(X,a)),f(f(X,f(Y,a)),Z)),
file(unknown,unknown) ).
tff(f_31,axiom,
! [X,Y] :
( ~ top(X,Y)
| step(X,Y) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [X] : seq(zero,X,X),
file(unknown,unknown) ).
tff(f_41,axiom,
! [Y,Z,X] :
( ~ step(Y,Z)
| step(f(X,Y),f(X,Z)) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [N,X,Y,Z] :
( ~ seq(N,X,Y)
| ~ step(Y,Z)
| seq(succ(N),X,Z) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X,Y,Z] :
( ~ step(X,Y)
| step(f(X,Z),f(Y,Z)) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X] : ~ seq(succ(succ(succ(zero))),X,X),
file(unknown,unknown) ).
tff(c_27,plain,
! [Z_32,Y_33,X_34] : top(f(f(Z_32,Y_33),f(X_34,a)),f(f(X_34,f(Y_33,a)),Z_32)),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_6,plain,
! [X_5,Y_6] :
( step(X_5,Y_6)
| ~ top(X_5,Y_6) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_31,plain,
! [Z_32,Y_33,X_34] : step(f(f(Z_32,Y_33),f(X_34,a)),f(f(X_34,f(Y_33,a)),Z_32)),
inference(resolution,[status(thm)],[c_27,c_6]) ).
tff(c_12,plain,
! [X_13] : seq(zero,X_13,X_13),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_10,plain,
! [X_12,Y_10,Z_11] :
( step(f(X_12,Y_10),f(X_12,Z_11))
| ~ step(Y_10,Z_11) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_20,plain,
! [N_28,X_29,Z_30,Y_31] :
( seq(succ(N_28),X_29,Z_30)
| ~ step(Y_31,Z_30)
| ~ seq(N_28,X_29,Y_31) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_45,plain,
! [Y_47,N_49,X_48,Z_50,X_46] :
( seq(succ(N_49),X_46,f(X_48,Z_50))
| ~ seq(N_49,X_46,f(X_48,Y_47))
| ~ step(Y_47,Z_50) ),
inference(resolution,[status(thm)],[c_10,c_20]) ).
tff(c_53,plain,
! [X_51,Y_52,Z_53] :
( seq(succ(zero),f(X_51,Y_52),f(X_51,Z_53))
| ~ step(Y_52,Z_53) ),
inference(resolution,[status(thm)],[c_12,c_45]) ).
tff(c_8,plain,
! [X_7,Z_9,Y_8] :
( step(f(X_7,Z_9),f(Y_8,Z_9))
| ~ step(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_26,plain,
! [Y_8,Z_9,X_29,X_7,N_28] :
( seq(succ(N_28),X_29,f(Y_8,Z_9))
| ~ seq(N_28,X_29,f(X_7,Z_9))
| ~ step(X_7,Y_8) ),
inference(resolution,[status(thm)],[c_8,c_20]) ).
tff(c_59,plain,
! [X_51,Y_52,Y_8,Z_53] :
( seq(succ(succ(zero)),f(X_51,Y_52),f(Y_8,Z_53))
| ~ step(X_51,Y_8)
| ~ step(Y_52,Z_53) ),
inference(resolution,[status(thm)],[c_53,c_26]) ).
tff(c_32,plain,
! [Z_35,Y_36,X_37] : step(f(f(Z_35,Y_36),f(X_37,a)),f(f(X_37,f(Y_36,a)),Z_35)),
inference(resolution,[status(thm)],[c_27,c_6]) ).
tff(c_14,plain,
! [N_14,X_15,Z_17,Y_16] :
( seq(succ(N_14),X_15,Z_17)
| ~ step(Y_16,Z_17)
| ~ seq(N_14,X_15,Y_16) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_87,plain,
! [N_67,Z_70,X_66,Y_68,X_69] :
( seq(succ(N_67),X_69,f(f(X_66,f(Y_68,a)),Z_70))
| ~ seq(N_67,X_69,f(f(Z_70,Y_68),f(X_66,a))) ),
inference(resolution,[status(thm)],[c_32,c_14]) ).
tff(c_4,plain,
! [X_4] : ~ seq(succ(succ(succ(zero))),X_4,X_4),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_99,plain,
! [X_71,Y_72,Z_73] : ~ seq(succ(succ(zero)),f(f(X_71,f(Y_72,a)),Z_73),f(f(Z_73,Y_72),f(X_71,a))),
inference(resolution,[status(thm)],[c_87,c_4]) ).
tff(c_110,plain,
! [X_74,Y_75,Y_76] :
( ~ step(f(X_74,f(Y_75,a)),f(Y_76,Y_75))
| ~ step(Y_76,f(X_74,a)) ),
inference(resolution,[status(thm)],[c_59,c_99]) ).
tff(c_128,plain,
! [Z_78,Y_79] : ~ step(f(Z_78,f(Y_79,a)),f(f(Z_78,Y_79),a)),
inference(resolution,[status(thm)],[c_31,c_110]) ).
tff(c_133,plain,
$false,
inference(resolution,[status(thm)],[c_31,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO691-1.000 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 15:14:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.71/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.71/1.63
% 2.71/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.87/1.66
% 2.87/1.66 Inference rules
% 2.87/1.66 ----------------------
% 2.87/1.66 #Ref : 0
% 2.87/1.66 #Sup : 27
% 2.87/1.66 #Fact : 0
% 2.87/1.66 #Define : 0
% 2.87/1.66 #Split : 1
% 2.87/1.66 #Chain : 0
% 2.87/1.66 #Close : 0
% 2.87/1.66
% 2.87/1.66 Ordering : KBO
% 2.87/1.66
% 2.87/1.66 Simplification rules
% 2.87/1.66 ----------------------
% 2.87/1.66 #Subsume : 2
% 2.87/1.66 #Demod : 0
% 2.87/1.66 #Tautology : 0
% 2.87/1.66 #SimpNegUnit : 0
% 2.87/1.66 #BackRed : 0
% 2.87/1.66
% 2.87/1.66 #Partial instantiations: 0
% 2.87/1.66 #Strategies tried : 1
% 2.87/1.66
% 2.87/1.66 Timing (in seconds)
% 2.87/1.66 ----------------------
% 2.87/1.66 Preprocessing : 0.37
% 2.87/1.66 Parsing : 0.21
% 2.87/1.66 CNF conversion : 0.02
% 2.87/1.66 Main loop : 0.27
% 2.87/1.66 Inferencing : 0.12
% 2.87/1.66 Reduction : 0.06
% 2.87/1.66 Demodulation : 0.04
% 2.87/1.66 BG Simplification : 0.01
% 2.87/1.66 Subsumption : 0.06
% 2.87/1.66 Abstraction : 0.01
% 2.87/1.66 MUC search : 0.00
% 2.87/1.66 Cooper : 0.00
% 2.87/1.66 Total : 0.69
% 2.87/1.66 Index Insertion : 0.00
% 2.87/1.66 Index Deletion : 0.00
% 2.87/1.66 Index Matching : 0.00
% 2.87/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------