TSTP Solution File: ROB021-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ROB021-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/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 : n024.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:06 EDT 2023
% Result : Unsatisfiable 107.73s 93.45s
% Output : CNFRefutation 107.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ add > #nlpp > negate > 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(f_48,axiom,
! [X,Y] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_52,axiom,
! [X,Y] : ( negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Y] :
( ( negate(X) != negate(Y) )
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_61,axiom,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
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_48]) ).
tff(c_219,plain,
! [X_20,Y_21] : ( negate(add(negate(add(X_20,Y_21)),negate(add(X_20,negate(Y_21))))) = X_20 ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_1804,plain,
! [X_42,Y_43] : ( negate(add(negate(add(X_42,Y_43)),negate(add(Y_43,negate(X_42))))) = Y_43 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_219]) ).
tff(c_2511,plain,
! [X_50,X_51] : ( negate(add(negate(add(X_50,X_51)),negate(add(negate(X_50),X_51)))) = X_51 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_1804]) ).
tff(c_8,plain,
! [Y_9,X_8] :
( ( Y_9 = X_8 )
| ( negate(Y_9) != negate(X_8) ) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_100700,plain,
! [X_50,X_8] : ( add(negate(add(X_50,negate(X_8))),negate(add(negate(X_50),negate(X_8)))) = X_8 ),
inference(superposition,[status(thm),theory(equality)],[c_2511,c_8]) ).
tff(c_10,plain,
add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_100703,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_100700,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : ROB021-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % 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 : n024.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 20:34:15 EDT 2023
% 0.15/0.36 % CPUTime :
% 107.73/93.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 107.73/93.45
% 107.73/93.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 107.79/93.48
% 107.79/93.48 Inference rules
% 107.79/93.48 ----------------------
% 107.79/93.48 #Ref : 5
% 107.79/93.48 #Sup : 26033
% 107.79/93.48 #Fact : 0
% 107.79/93.48 #Define : 0
% 107.79/93.48 #Split : 0
% 107.79/93.48 #Chain : 0
% 107.79/93.48 #Close : 0
% 107.79/93.48
% 107.79/93.48 Ordering : KBO
% 107.79/93.48
% 107.79/93.48 Simplification rules
% 107.79/93.48 ----------------------
% 107.79/93.48 #Subsume : 2745
% 107.79/93.48 #Demod : 35502
% 107.79/93.48 #Tautology : 1067
% 107.79/93.48 #SimpNegUnit : 0
% 107.79/93.48 #BackRed : 1
% 107.79/93.48
% 107.79/93.48 #Partial instantiations: 0
% 107.79/93.48 #Strategies tried : 1
% 107.79/93.48
% 107.79/93.48 Timing (in seconds)
% 107.79/93.48 ----------------------
% 107.79/93.48 Preprocessing : 0.41
% 107.79/93.48 Parsing : 0.21
% 107.79/93.48 CNF conversion : 0.02
% 107.79/93.48 Main loop : 91.95
% 107.79/93.48 Inferencing : 3.38
% 107.79/93.48 Reduction : 84.67
% 107.79/93.48 Demodulation : 83.77
% 107.79/93.48 BG Simplification : 0.82
% 107.79/93.48 Subsumption : 2.46
% 107.79/93.48 Abstraction : 1.34
% 107.79/93.48 MUC search : 0.00
% 107.79/93.48 Cooper : 0.00
% 107.79/93.48 Total : 92.40
% 107.79/93.48 Index Insertion : 0.00
% 107.79/93.48 Index Deletion : 0.00
% 107.79/93.48 Index Matching : 0.00
% 107.79/93.48 BG Taut test : 0.00
%------------------------------------------------------------------------------