TSTP Solution File: SYN986+1.003 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN986+1.003 : TPTP v8.1.2. Released v4.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 11:17:04 EDT 2023
% Result : Theorem 3.06s 1.74s
% Output : CNFRefutation 3.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 6 unt; 3 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 81 ( 42 ~; 34 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 16 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 62 (; 58 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > #nlpp > succ > zero
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(r,type,
r: ( $i * $i * $i ) > $o ).
tff(succ,type,
succ: $i > $i ).
tff(zero,type,
zero: $i ).
tff(f_57,axiom,
! [Y] : r(Y,zero,succ(Y)),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN002+0.ax',hyp1) ).
tff(f_63,axiom,
! [Y,X,Z,Z1] :
( r(Y,X,Z)
=> ( r(Z,X,Z1)
=> r(Y,succ(X),Z1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN002+0.ax',hyp2) ).
tff(f_74,negated_conjecture,
~ ? [Z3,Z2,Z1,Z0] :
( r(zero,zero,Z3)
& r(zero,Z3,Z2)
& r(zero,Z2,Z1)
& r(zero,Z1,Z0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ck) ).
tff(c_2,plain,
! [Y_1] : r(Y_1,zero,succ(Y_1)),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_8,plain,
! [Y_11,X_12,Z1_13,Z_14] :
( r(Y_11,succ(X_12),Z1_13)
| ~ r(Z_14,X_12,Z1_13)
| ~ r(Y_11,X_12,Z_14) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_11,plain,
! [Y_11,Y_1] :
( r(Y_11,succ(zero),succ(Y_1))
| ~ r(Y_11,zero,Y_1) ),
inference(resolution,[status(thm)],[c_2,c_8]) ).
tff(c_12,plain,
! [Y_15,Y_16] :
( r(Y_15,succ(zero),succ(Y_16))
| ~ r(Y_15,zero,Y_16) ),
inference(resolution,[status(thm)],[c_2,c_8]) ).
tff(c_4,plain,
! [Y_2,X_3,Z1_5,Z_4] :
( r(Y_2,succ(X_3),Z1_5)
| ~ r(Z_4,X_3,Z1_5)
| ~ r(Y_2,X_3,Z_4) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_26,plain,
! [Y_23,Y_24,Y_25] :
( r(Y_23,succ(succ(zero)),succ(Y_24))
| ~ r(Y_23,succ(zero),Y_25)
| ~ r(Y_25,zero,Y_24) ),
inference(resolution,[status(thm)],[c_12,c_4]) ).
tff(c_30,plain,
! [Y_26,Y_27,Y_28] :
( r(Y_26,succ(succ(zero)),succ(Y_27))
| ~ r(succ(Y_28),zero,Y_27)
| ~ r(Y_26,zero,Y_28) ),
inference(resolution,[status(thm)],[c_11,c_26]) ).
tff(c_34,plain,
! [Y_26,Y_28] :
( r(Y_26,succ(succ(zero)),succ(succ(succ(Y_28))))
| ~ r(Y_26,zero,Y_28) ),
inference(resolution,[status(thm)],[c_2,c_30]) ).
tff(c_35,plain,
! [Y_29,Y_30] :
( r(Y_29,succ(succ(zero)),succ(succ(succ(Y_30))))
| ~ r(Y_29,zero,Y_30) ),
inference(resolution,[status(thm)],[c_2,c_30]) ).
tff(c_90,plain,
! [Y_39,Y_40,Y_41] :
( r(Y_39,succ(succ(succ(zero))),succ(succ(succ(Y_40))))
| ~ r(Y_39,succ(succ(zero)),Y_41)
| ~ r(Y_41,zero,Y_40) ),
inference(resolution,[status(thm)],[c_35,c_4]) ).
tff(c_94,plain,
! [Y_42,Y_43,Y_44] :
( r(Y_42,succ(succ(succ(zero))),succ(succ(succ(Y_43))))
| ~ r(succ(succ(succ(Y_44))),zero,Y_43)
| ~ r(Y_42,zero,Y_44) ),
inference(resolution,[status(thm)],[c_34,c_90]) ).
tff(c_98,plain,
! [Y_42,Y_44] :
( r(Y_42,succ(succ(succ(zero))),succ(succ(succ(succ(succ(succ(succ(Y_44))))))))
| ~ r(Y_42,zero,Y_44) ),
inference(resolution,[status(thm)],[c_2,c_94]) ).
tff(c_99,plain,
! [Y_45,Y_46] :
( r(Y_45,succ(succ(succ(zero))),succ(succ(succ(succ(succ(succ(succ(Y_46))))))))
| ~ r(Y_45,zero,Y_46) ),
inference(resolution,[status(thm)],[c_2,c_94]) ).
tff(c_124,plain,
! [Y_50,Y_51,Y_52] :
( r(Y_50,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(Y_51))))))))
| ~ r(Y_50,succ(succ(succ(zero))),Y_52)
| ~ r(Y_52,zero,Y_51) ),
inference(resolution,[status(thm)],[c_99,c_4]) ).
tff(c_128,plain,
! [Y_53,Y_54,Y_55] :
( r(Y_53,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(Y_54))))))))
| ~ r(succ(succ(succ(succ(succ(succ(succ(Y_55))))))),zero,Y_54)
| ~ r(Y_53,zero,Y_55) ),
inference(resolution,[status(thm)],[c_98,c_124]) ).
tff(c_133,plain,
! [Y_56,Y_57] :
( r(Y_56,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(Y_57))))))))))))))))
| ~ r(Y_56,zero,Y_57) ),
inference(resolution,[status(thm)],[c_2,c_128]) ).
tff(c_6,plain,
! [Z1_8,Z0_9,Z2_7,Z3_6] :
( ~ r(zero,Z1_8,Z0_9)
| ~ r(zero,Z2_7,Z1_8)
| ~ r(zero,Z3_6,Z2_7)
| ~ r(zero,zero,Z3_6) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_139,plain,
! [Z2_7,Z3_6,Y_57] :
( ~ r(zero,Z2_7,succ(succ(succ(succ(zero)))))
| ~ r(zero,Z3_6,Z2_7)
| ~ r(zero,zero,Z3_6)
| ~ r(zero,zero,Y_57) ),
inference(resolution,[status(thm)],[c_133,c_6]) ).
tff(c_142,plain,
! [Y_58] : ~ r(zero,zero,Y_58),
inference(splitLeft,[status(thm)],[c_139]) ).
tff(c_147,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_142]) ).
tff(c_149,plain,
! [Z2_59,Z3_60] :
( ~ r(zero,Z2_59,succ(succ(succ(succ(zero)))))
| ~ r(zero,Z3_60,Z2_59)
| ~ r(zero,zero,Z3_60) ),
inference(splitRight,[status(thm)],[c_139]) ).
tff(c_152,plain,
! [Z3_60] :
( ~ r(zero,Z3_60,succ(succ(zero)))
| ~ r(zero,zero,Z3_60)
| ~ r(zero,zero,succ(zero)) ),
inference(resolution,[status(thm)],[c_34,c_149]) ).
tff(c_160,plain,
! [Z3_61] :
( ~ r(zero,Z3_61,succ(succ(zero)))
| ~ r(zero,zero,Z3_61) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_152]) ).
tff(c_164,plain,
~ r(zero,zero,succ(zero)),
inference(resolution,[status(thm)],[c_11,c_160]) ).
tff(c_168,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN986+1.003 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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 17:01:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.06/1.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.74
% 3.06/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.06/1.78
% 3.06/1.78 Inference rules
% 3.06/1.78 ----------------------
% 3.06/1.78 #Ref : 0
% 3.06/1.78 #Sup : 30
% 3.06/1.78 #Fact : 0
% 3.06/1.78 #Define : 0
% 3.06/1.78 #Split : 5
% 3.06/1.78 #Chain : 0
% 3.06/1.78 #Close : 0
% 3.06/1.78
% 3.06/1.78 Ordering : KBO
% 3.06/1.78
% 3.06/1.78 Simplification rules
% 3.06/1.78 ----------------------
% 3.06/1.78 #Subsume : 26
% 3.06/1.78 #Demod : 4
% 3.06/1.78 #Tautology : 0
% 3.06/1.78 #SimpNegUnit : 0
% 3.06/1.78 #BackRed : 0
% 3.06/1.78
% 3.06/1.78 #Partial instantiations: 0
% 3.06/1.78 #Strategies tried : 1
% 3.06/1.78
% 3.06/1.78 Timing (in seconds)
% 3.06/1.78 ----------------------
% 3.06/1.79 Preprocessing : 0.41
% 3.06/1.79 Parsing : 0.22
% 3.06/1.79 CNF conversion : 0.02
% 3.06/1.79 Main loop : 0.31
% 3.06/1.79 Inferencing : 0.13
% 3.06/1.79 Reduction : 0.06
% 3.06/1.79 Demodulation : 0.04
% 3.06/1.79 BG Simplification : 0.01
% 3.06/1.79 Subsumption : 0.09
% 3.06/1.79 Abstraction : 0.01
% 3.06/1.79 MUC search : 0.00
% 3.06/1.79 Cooper : 0.00
% 3.06/1.79 Total : 0.77
% 3.06/1.79 Index Insertion : 0.00
% 3.06/1.79 Index Deletion : 0.00
% 3.06/1.79 Index Matching : 0.00
% 3.06/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------