TSTP Solution File: FLD010-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD010-3 : 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/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 : n019.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:27 EDT 2023
% Result : Unsatisfiable 3.70s 1.88s
% Output : CNFRefutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 24 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > additive_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
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(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_250,axiom,
~ sum(additive_identity,multiplicative_identity,additive_identity),
file(unknown,unknown) ).
tff(f_173,axiom,
defined(multiplicative_identity),
file(unknown,unknown) ).
tff(f_117,axiom,
! [X] :
( product(multiplicative_inverse(X),X,multiplicative_identity)
| sum(additive_identity,X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_252,axiom,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
file(unknown,unknown) ).
tff(c_54,plain,
~ sum(additive_identity,multiplicative_identity,additive_identity),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_34,plain,
defined(multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_134,plain,
! [X_104] :
( ~ defined(X_104)
| sum(additive_identity,X_104,additive_identity)
| product(multiplicative_inverse(X_104),X_104,multiplicative_identity) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_20,plain,
! [X_33,Y_32,Z_34] :
( ~ product(X_33,Y_32,Z_34)
| product(Y_32,X_33,Z_34) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_246,plain,
! [X_122] :
( product(X_122,multiplicative_inverse(X_122),multiplicative_identity)
| ~ defined(X_122)
| sum(additive_identity,X_122,additive_identity) ),
inference(resolution,[status(thm)],[c_134,c_20]) ).
tff(c_56,plain,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_254,plain,
( ~ defined(multiplicative_identity)
| sum(additive_identity,multiplicative_identity,additive_identity) ),
inference(resolution,[status(thm)],[c_246,c_56]) ).
tff(c_260,plain,
sum(additive_identity,multiplicative_identity,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_254]) ).
tff(c_262,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_54,c_260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : FLD010-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.15 % 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.19/0.36 % Computer : n019.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Thu Aug 3 20:00:16 EDT 2023
% 0.22/0.37 % CPUTime :
% 3.70/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.70/1.88
% 3.70/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.88/1.91
% 3.88/1.91 Inference rules
% 3.88/1.91 ----------------------
% 3.88/1.91 #Ref : 0
% 3.88/1.91 #Sup : 44
% 3.88/1.91 #Fact : 2
% 3.88/1.91 #Define : 0
% 3.88/1.91 #Split : 1
% 3.88/1.91 #Chain : 0
% 3.88/1.91 #Close : 0
% 3.88/1.91
% 3.88/1.91 Ordering : KBO
% 3.88/1.91
% 3.88/1.91 Simplification rules
% 3.88/1.91 ----------------------
% 3.88/1.91 #Subsume : 13
% 3.88/1.91 #Demod : 13
% 3.88/1.91 #Tautology : 6
% 3.88/1.91 #SimpNegUnit : 1
% 3.88/1.91 #BackRed : 0
% 3.88/1.91
% 3.88/1.91 #Partial instantiations: 0
% 3.88/1.91 #Strategies tried : 1
% 3.88/1.91
% 3.88/1.91 Timing (in seconds)
% 3.88/1.91 ----------------------
% 3.88/1.91 Preprocessing : 0.51
% 3.88/1.91 Parsing : 0.28
% 3.88/1.92 CNF conversion : 0.03
% 3.88/1.92 Main loop : 0.36
% 3.88/1.92 Inferencing : 0.15
% 3.88/1.92 Reduction : 0.08
% 3.88/1.92 Demodulation : 0.05
% 3.88/1.92 BG Simplification : 0.02
% 3.88/1.92 Subsumption : 0.09
% 3.88/1.92 Abstraction : 0.01
% 3.88/1.92 MUC search : 0.00
% 3.88/1.92 Cooper : 0.00
% 3.88/1.92 Total : 0.92
% 3.88/1.92 Index Insertion : 0.00
% 3.88/1.92 Index Deletion : 0.00
% 3.88/1.92 Index Matching : 0.00
% 3.88/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------