TSTP Solution File: FLD071-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD071-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 : n021.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:42 EDT 2023
% Result : Unsatisfiable 4.13s 1.91s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 21 ( 7 unt; 11 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 8 ( 8 usr; 4 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 > 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(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_238,axiom,
less_or_equal(additive_identity,a),
file(unknown,unknown) ).
tff(f_239,axiom,
less_or_equal(additive_identity,b),
file(unknown,unknown) ).
tff(f_189,axiom,
! [Y,Z] :
( less_or_equal(additive_identity,multiply(Y,Z))
| ~ less_or_equal(additive_identity,Y)
| ~ less_or_equal(additive_identity,Z) ),
file(unknown,unknown) ).
tff(f_241,axiom,
~ less_or_equal(additive_identity,multiply(a,b)),
file(unknown,unknown) ).
tff(c_60,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_62,plain,
less_or_equal(additive_identity,b),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_351,plain,
! [Z_90,Y_91] :
( ~ less_or_equal(additive_identity,Z_90)
| ~ less_or_equal(additive_identity,Y_91)
| less_or_equal(additive_identity,multiply(Y_91,Z_90)) ),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_64,plain,
~ less_or_equal(additive_identity,multiply(a,b)),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_360,plain,
( ~ less_or_equal(additive_identity,b)
| ~ less_or_equal(additive_identity,a) ),
inference(resolution,[status(thm)],[c_351,c_64]) ).
tff(c_368,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_60,c_62,c_360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD071-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 : n021.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:50:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.13/1.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.13/1.92
% 4.13/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.13/1.94
% 4.13/1.94 Inference rules
% 4.13/1.94 ----------------------
% 4.13/1.94 #Ref : 0
% 4.13/1.94 #Sup : 68
% 4.13/1.94 #Fact : 2
% 4.13/1.94 #Define : 0
% 4.13/1.94 #Split : 2
% 4.13/1.94 #Chain : 0
% 4.13/1.94 #Close : 0
% 4.13/1.94
% 4.13/1.94 Ordering : KBO
% 4.13/1.94
% 4.13/1.94 Simplification rules
% 4.13/1.94 ----------------------
% 4.13/1.94 #Subsume : 19
% 4.13/1.94 #Demod : 23
% 4.13/1.94 #Tautology : 10
% 4.13/1.94 #SimpNegUnit : 0
% 4.13/1.94 #BackRed : 0
% 4.13/1.94
% 4.13/1.94 #Partial instantiations: 0
% 4.13/1.94 #Strategies tried : 1
% 4.13/1.94
% 4.13/1.94 Timing (in seconds)
% 4.13/1.94 ----------------------
% 4.13/1.95 Preprocessing : 0.51
% 4.13/1.95 Parsing : 0.28
% 4.13/1.95 CNF conversion : 0.03
% 4.13/1.95 Main loop : 0.40
% 4.13/1.95 Inferencing : 0.16
% 4.13/1.95 Reduction : 0.09
% 4.13/1.95 Demodulation : 0.07
% 4.13/1.95 BG Simplification : 0.02
% 4.13/1.95 Subsumption : 0.10
% 4.13/1.95 Abstraction : 0.01
% 4.13/1.95 MUC search : 0.00
% 4.13/1.95 Cooper : 0.00
% 4.13/1.95 Total : 0.95
% 4.13/1.95 Index Insertion : 0.00
% 4.13/1.95 Index Deletion : 0.00
% 4.13/1.95 Index Matching : 0.00
% 4.13/1.95 BG Taut test : 0.00
%------------------------------------------------------------------------------