TSTP Solution File: ROB010-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ROB010-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:04 EDT 2023
% Result : Unsatisfiable 2.89s 1.75s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 17 ( 12 unt; 5 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 6 ( 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ add > #nlpp > negate > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(negate,type,
negate: $i > $i ).
tff(c,type,
c: $i ).
tff(f_47,axiom,
! [X,Y] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_56,axiom,
negate(add(c,negate(add(b,a)))) != a,
file(unknown,unknown) ).
tff(f_54,axiom,
negate(add(a,negate(b))) = c,
file(unknown,unknown) ).
tff(f_51,axiom,
! [X,Y] : ( negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X ),
file(unknown,unknown) ).
tff(c_2,plain,
! [Y_2,X_1] : ( add(Y_2,X_1) = add(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_10,plain,
negate(add(c,negate(add(b,a)))) != a,
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_11,plain,
negate(add(c,negate(add(a,b)))) != a,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_10]) ).
tff(c_8,plain,
negate(add(a,negate(b))) = c,
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_219,plain,
! [X_16,Y_17] : ( negate(add(negate(add(X_16,Y_17)),negate(add(X_16,negate(Y_17))))) = X_16 ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_279,plain,
negate(add(negate(add(a,b)),c)) = a,
inference(superposition,[status(thm),theory(equality)],[c_8,c_219]) ).
tff(c_289,plain,
negate(add(c,negate(add(a,b)))) = a,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_279]) ).
tff(c_291,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_11,c_289]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : ROB010-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/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.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 20:51:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.89/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.89/1.75
% 2.89/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.17/1.77
% 3.17/1.77 Inference rules
% 3.17/1.77 ----------------------
% 3.17/1.77 #Ref : 0
% 3.17/1.77 #Sup : 75
% 3.17/1.77 #Fact : 0
% 3.17/1.77 #Define : 0
% 3.17/1.77 #Split : 0
% 3.17/1.77 #Chain : 0
% 3.17/1.77 #Close : 0
% 3.17/1.77
% 3.17/1.77 Ordering : KBO
% 3.17/1.77
% 3.17/1.77 Simplification rules
% 3.17/1.77 ----------------------
% 3.17/1.77 #Subsume : 4
% 3.17/1.77 #Demod : 29
% 3.17/1.77 #Tautology : 24
% 3.17/1.77 #SimpNegUnit : 1
% 3.17/1.77 #BackRed : 0
% 3.17/1.77
% 3.17/1.77 #Partial instantiations: 0
% 3.17/1.77 #Strategies tried : 1
% 3.17/1.77
% 3.17/1.77 Timing (in seconds)
% 3.17/1.77 ----------------------
% 3.17/1.78 Preprocessing : 0.40
% 3.17/1.78 Parsing : 0.21
% 3.17/1.78 CNF conversion : 0.02
% 3.17/1.78 Main loop : 0.32
% 3.17/1.78 Inferencing : 0.10
% 3.17/1.78 Reduction : 0.13
% 3.17/1.78 Demodulation : 0.11
% 3.17/1.78 BG Simplification : 0.02
% 3.17/1.78 Subsumption : 0.05
% 3.17/1.78 Abstraction : 0.02
% 3.17/1.78 MUC search : 0.00
% 3.17/1.78 Cooper : 0.00
% 3.17/1.78 Total : 0.76
% 3.17/1.78 Index Insertion : 0.00
% 3.17/1.78 Index Deletion : 0.00
% 3.17/1.78 Index Matching : 0.00
% 3.17/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------