TSTP Solution File: FLD030-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD030-1 : TPTP v8.1.2. Bugfixed v2.1.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 : n004.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:37:31 EDT 2023
% Result : Unsatisfiable 4.29s 2.05s
% Output : CNFRefutation 4.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 17
% Syntax : Number of formulae : 25 ( 8 unt; 12 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > d > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(b,type,
b: $i ).
tff(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(d,type,
d: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_237,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_239,axiom,
equalish(a,d),
file(unknown,unknown) ).
tff(f_199,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_223,axiom,
! [X,Z,Y] :
( equalish(multiply(X,Z),multiply(Y,Z))
| ~ defined(Z)
| ~ equalish(X,Y) ),
file(unknown,unknown) ).
tff(f_241,axiom,
~ equalish(multiply(d,b),multiply(a,b)),
file(unknown,unknown) ).
tff(c_58,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_62,plain,
equalish(a,d),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_67,plain,
! [Y_53,X_54] :
( ~ equalish(Y_53,X_54)
| equalish(X_54,Y_53) ),
inference(cnfTransformation,[status(thm)],[f_199]) ).
tff(c_73,plain,
equalish(d,a),
inference(resolution,[status(thm)],[c_62,c_67]) ).
tff(c_582,plain,
! [X_94,Y_95,Z_96] :
( ~ equalish(X_94,Y_95)
| ~ defined(Z_96)
| equalish(multiply(X_94,Z_96),multiply(Y_95,Z_96)) ),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_64,plain,
~ equalish(multiply(d,b),multiply(a,b)),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_589,plain,
( ~ equalish(d,a)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_582,c_64]) ).
tff(c_597,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_58,c_73,c_589]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD030-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.13 % 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 19:54:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.29/2.05 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.29/2.06
% 4.29/2.06 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.70/2.09
% 4.70/2.09 Inference rules
% 4.70/2.09 ----------------------
% 4.70/2.09 #Ref : 0
% 4.70/2.09 #Sup : 140
% 4.70/2.09 #Fact : 2
% 4.70/2.09 #Define : 0
% 4.70/2.09 #Split : 0
% 4.70/2.09 #Chain : 0
% 4.70/2.09 #Close : 0
% 4.70/2.09
% 4.70/2.09 Ordering : KBO
% 4.70/2.09
% 4.70/2.09 Simplification rules
% 4.70/2.09 ----------------------
% 4.70/2.09 #Subsume : 9
% 4.70/2.09 #Demod : 34
% 4.70/2.09 #Tautology : 33
% 4.70/2.09 #SimpNegUnit : 0
% 4.70/2.09 #BackRed : 0
% 4.70/2.09
% 4.70/2.09 #Partial instantiations: 0
% 4.70/2.09 #Strategies tried : 1
% 4.70/2.09
% 4.70/2.09 Timing (in seconds)
% 4.70/2.09 ----------------------
% 4.70/2.09 Preprocessing : 0.53
% 4.70/2.09 Parsing : 0.29
% 4.70/2.09 CNF conversion : 0.03
% 4.70/2.09 Main loop : 0.51
% 4.70/2.09 Inferencing : 0.21
% 4.70/2.09 Reduction : 0.13
% 4.70/2.09 Demodulation : 0.09
% 4.70/2.09 BG Simplification : 0.03
% 4.70/2.09 Subsumption : 0.12
% 4.70/2.09 Abstraction : 0.02
% 4.70/2.09 MUC search : 0.00
% 4.70/2.09 Cooper : 0.00
% 4.70/2.09 Total : 1.09
% 4.70/2.09 Index Insertion : 0.00
% 4.70/2.09 Index Deletion : 0.00
% 4.70/2.09 Index Matching : 0.00
% 4.70/2.09 BG Taut test : 0.00
%------------------------------------------------------------------------------