TSTP Solution File: FLD039-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD039-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 : n007.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:34 EDT 2023
% Result : Unsatisfiable 3.32s 1.77s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 18 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_or_equal > equalish > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > 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(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_235,axiom,
~ equalish(additive_identity,multiplicative_identity),
file(unknown,unknown) ).
tff(f_241,axiom,
equalish(multiplicative_identity,additive_identity),
file(unknown,unknown) ).
tff(f_201,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file(unknown,unknown) ).
tff(c_54,plain,
~ equalish(additive_identity,multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_60,plain,
equalish(multiplicative_identity,additive_identity),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_63,plain,
! [Y_53,X_54] :
( ~ equalish(Y_53,X_54)
| equalish(X_54,Y_53) ),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_67,plain,
equalish(additive_identity,multiplicative_identity),
inference(resolution,[status(thm)],[c_60,c_63]) ).
tff(c_72,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_54,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD039-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/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.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 19:36:38 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.32/1.77 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/1.78
% 3.32/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/1.80
% 3.38/1.80 Inference rules
% 3.38/1.80 ----------------------
% 3.38/1.80 #Ref : 0
% 3.38/1.80 #Sup : 2
% 3.38/1.80 #Fact : 0
% 3.38/1.80 #Define : 0
% 3.38/1.80 #Split : 0
% 3.38/1.80 #Chain : 0
% 3.38/1.80 #Close : 0
% 3.38/1.80
% 3.38/1.80 Ordering : KBO
% 3.38/1.80
% 3.38/1.80 Simplification rules
% 3.38/1.80 ----------------------
% 3.38/1.80 #Subsume : 1
% 3.38/1.80 #Demod : 0
% 3.38/1.80 #Tautology : 0
% 3.38/1.80 #SimpNegUnit : 1
% 3.38/1.80 #BackRed : 0
% 3.38/1.80
% 3.38/1.80 #Partial instantiations: 0
% 3.38/1.80 #Strategies tried : 1
% 3.38/1.80
% 3.38/1.80 Timing (in seconds)
% 3.38/1.80 ----------------------
% 3.38/1.80 Preprocessing : 0.52
% 3.38/1.80 Parsing : 0.29
% 3.38/1.80 CNF conversion : 0.03
% 3.38/1.80 Main loop : 0.21
% 3.38/1.80 Inferencing : 0.07
% 3.38/1.80 Reduction : 0.06
% 3.38/1.80 Demodulation : 0.04
% 3.38/1.80 BG Simplification : 0.02
% 3.38/1.80 Subsumption : 0.05
% 3.38/1.80 Abstraction : 0.01
% 3.38/1.80 MUC search : 0.00
% 3.38/1.80 Cooper : 0.00
% 3.38/1.81 Total : 0.77
% 3.38/1.81 Index Insertion : 0.00
% 3.38/1.81 Index Deletion : 0.00
% 3.38/1.81 Index Matching : 0.00
% 3.38/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------