TSTP Solution File: ROB016-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ROB016-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 : n015.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:55:05 EDT 2023
% Result : Unsatisfiable 4.43s 2.11s
% Output : CNFRefutation 4.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 14
% Syntax : Number of formulae : 22 ( 10 unt; 9 typ; 0 def)
% Number of atoms : 18 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ positive_integer > multiply > add > #nlpp > successor > negate > one > k > e > d
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(k,type,
k: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(positive_integer,type,
positive_integer: $i > $o ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(one,type,
one: $i ).
tff(negate,type,
negate: $i > $i ).
tff(d,type,
d: $i ).
tff(e,type,
e: $i ).
tff(successor,type,
successor: $i > $i ).
tff(f_88,axiom,
negate(add(d,e)) = negate(e),
file(unknown,unknown) ).
tff(f_49,axiom,
! [X,Y] : ( negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X ),
file(unknown,unknown) ).
tff(f_89,axiom,
positive_integer(k),
file(unknown,unknown) ).
tff(f_98,axiom,
! [Y,X,Vk] :
( ( negate(add(negate(Y),negate(add(X,negate(Y))))) != X )
| ~ positive_integer(Vk)
| ( negate(add(Y,multiply(Vk,add(X,negate(add(X,negate(Y))))))) = negate(Y) ) ),
file(unknown,unknown) ).
tff(f_100,axiom,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
file(unknown,unknown) ).
tff(c_16,plain,
negate(add(d,e)) = negate(e),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_455,plain,
! [X_31,Y_32] : ( negate(add(negate(add(X_31,Y_32)),negate(add(X_31,negate(Y_32))))) = X_31 ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_526,plain,
negate(add(negate(e),negate(add(d,negate(e))))) = d,
inference(superposition,[status(thm),theory(equality)],[c_16,c_455]) ).
tff(c_18,plain,
positive_integer(k),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1314,plain,
! [Y_42,Vk_43,X_44] :
( ( negate(add(Y_42,multiply(Vk_43,add(X_44,negate(add(X_44,negate(Y_42))))))) = negate(Y_42) )
| ~ positive_integer(Vk_43)
| ( negate(add(negate(Y_42),negate(add(X_44,negate(Y_42))))) != X_44 ) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_22,plain,
negate(add(e,multiply(k,add(d,negate(add(d,negate(e))))))) != negate(e),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_1323,plain,
( ~ positive_integer(k)
| ( negate(add(negate(e),negate(add(d,negate(e))))) != d ) ),
inference(superposition,[status(thm),theory(equality)],[c_1314,c_22]) ).
tff(c_1408,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_526,c_18,c_1323]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ROB016-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 : n015.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 20:50:59 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.43/2.11 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.43/2.11
% 4.43/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.43/2.14
% 4.43/2.14 Inference rules
% 4.43/2.14 ----------------------
% 4.43/2.14 #Ref : 0
% 4.43/2.14 #Sup : 373
% 4.43/2.14 #Fact : 0
% 4.43/2.14 #Define : 0
% 4.43/2.14 #Split : 0
% 4.43/2.14 #Chain : 0
% 4.43/2.14 #Close : 0
% 4.43/2.14
% 4.43/2.14 Ordering : KBO
% 4.43/2.14
% 4.43/2.14 Simplification rules
% 4.43/2.14 ----------------------
% 4.43/2.14 #Subsume : 39
% 4.43/2.14 #Demod : 154
% 4.43/2.14 #Tautology : 69
% 4.43/2.14 #SimpNegUnit : 0
% 4.43/2.14 #BackRed : 0
% 4.43/2.14
% 4.43/2.14 #Partial instantiations: 0
% 4.43/2.14 #Strategies tried : 1
% 4.43/2.14
% 4.43/2.14 Timing (in seconds)
% 4.43/2.14 ----------------------
% 4.43/2.14 Preprocessing : 0.46
% 4.43/2.14 Parsing : 0.23
% 4.43/2.14 CNF conversion : 0.02
% 4.43/2.14 Main loop : 0.62
% 4.43/2.14 Inferencing : 0.20
% 4.43/2.14 Reduction : 0.27
% 4.43/2.14 Demodulation : 0.23
% 4.43/2.14 BG Simplification : 0.03
% 4.43/2.14 Subsumption : 0.09
% 4.43/2.14 Abstraction : 0.04
% 4.43/2.14 MUC search : 0.00
% 4.43/2.14 Cooper : 0.00
% 4.43/2.14 Total : 1.13
% 4.43/2.14 Index Insertion : 0.00
% 4.43/2.14 Index Deletion : 0.00
% 4.43/2.14 Index Matching : 0.00
% 4.43/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------