TSTP Solution File: SYN986+1.001 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN986+1.001 : 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/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 : n023.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:03 EDT 2023
% Result : Theorem 2.54s 1.71s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 13 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 5 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 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 : 18 (; 16 !; 2 ?; 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/sandbox/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/sandbox/benchmark/Axioms/SYN002+0.ax',hyp2) ).
tff(f_70,negated_conjecture,
~ ? [Z1,Z0] :
( r(zero,zero,Z1)
& r(zero,Z1,Z0) ),
file('/export/starexec/sandbox/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_13,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_17,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_13]) ).
tff(c_6,plain,
! [Z1_6,Z0_7] :
( ~ r(zero,Z1_6,Z0_7)
| ~ r(zero,zero,Z1_6) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_22,plain,
! [Y_16] :
( ~ r(zero,zero,succ(zero))
| ~ r(zero,zero,Y_16) ),
inference(resolution,[status(thm)],[c_17,c_6]) ).
tff(c_27,plain,
! [Y_17] : ~ r(zero,zero,Y_17),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_22]) ).
tff(c_32,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : SYN986+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.15 % 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 : n023.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 17:39:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.54/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.54/1.72
% 2.54/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.84/1.75
% 2.84/1.75 Inference rules
% 2.84/1.75 ----------------------
% 2.84/1.75 #Ref : 0
% 2.84/1.75 #Sup : 5
% 2.84/1.75 #Fact : 0
% 2.84/1.75 #Define : 0
% 2.84/1.75 #Split : 0
% 2.84/1.75 #Chain : 0
% 2.84/1.75 #Close : 0
% 2.84/1.75
% 2.84/1.75 Ordering : KBO
% 2.84/1.75
% 2.84/1.75 Simplification rules
% 2.84/1.75 ----------------------
% 2.84/1.75 #Subsume : 2
% 2.84/1.75 #Demod : 1
% 2.84/1.75 #Tautology : 0
% 2.84/1.75 #SimpNegUnit : 0
% 2.84/1.75 #BackRed : 0
% 2.84/1.75
% 2.84/1.75 #Partial instantiations: 0
% 2.84/1.75 #Strategies tried : 1
% 2.84/1.75
% 2.84/1.75 Timing (in seconds)
% 2.84/1.75 ----------------------
% 2.84/1.76 Preprocessing : 0.44
% 2.84/1.76 Parsing : 0.24
% 2.84/1.76 CNF conversion : 0.02
% 2.84/1.76 Main loop : 0.14
% 2.84/1.76 Inferencing : 0.06
% 2.84/1.76 Reduction : 0.03
% 2.84/1.76 Demodulation : 0.02
% 2.84/1.76 BG Simplification : 0.01
% 2.84/1.76 Subsumption : 0.03
% 2.84/1.76 Abstraction : 0.00
% 2.84/1.76 MUC search : 0.00
% 2.84/1.76 Cooper : 0.00
% 2.84/1.76 Total : 0.63
% 2.84/1.76 Index Insertion : 0.00
% 2.84/1.76 Index Deletion : 0.00
% 2.84/1.76 Index Matching : 0.00
% 2.84/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------