TSTP Solution File: FLD070-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD070-4 : 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 : n027.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.01s 2.01s
% Output : CNFRefutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 35 ( 13 unt; 13 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 20 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > c > b > additive_identity > a
%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(a,type,
a: $i ).
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(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(c,type,
c: $i ).
tff(f_253,axiom,
less_or_equal(additive_identity,b),
file(unknown,unknown) ).
tff(f_250,axiom,
defined(b),
file(unknown,unknown) ).
tff(f_252,axiom,
less_or_equal(additive_identity,a),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X] :
( sum(additive_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_254,axiom,
sum(a,b,c),
file(unknown,unknown) ).
tff(f_233,axiom,
! [U,Z,X,Y,V] :
( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U)
| ~ sum(Y,Z,V) ),
file(unknown,unknown) ).
tff(f_212,axiom,
! [X,Z,Y] :
( less_or_equal(X,Z)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,Z) ),
file(unknown,unknown) ).
tff(f_256,axiom,
~ less_or_equal(additive_identity,c),
file(unknown,unknown) ).
tff(c_62,plain,
less_or_equal(additive_identity,b),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_56,plain,
defined(b),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_60,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_6,plain,
! [X_13] :
( ~ defined(X_13)
| sum(additive_identity,X_13,X_13) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_64,plain,
sum(a,b,c),
inference(cnfTransformation,[status(thm)],[f_254]) ).
tff(c_339,plain,
! [X_125,U_124,Z_126,Y_127,V_128] :
( ~ sum(Y_127,Z_126,V_128)
| ~ sum(X_125,Z_126,U_124)
| ~ less_or_equal(X_125,Y_127)
| less_or_equal(U_124,V_128) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_370,plain,
! [X_129,U_130] :
( ~ sum(X_129,b,U_130)
| ~ less_or_equal(X_129,a)
| less_or_equal(U_130,c) ),
inference(resolution,[status(thm)],[c_64,c_339]) ).
tff(c_390,plain,
( ~ less_or_equal(additive_identity,a)
| less_or_equal(b,c)
| ~ defined(b) ),
inference(resolution,[status(thm)],[c_6,c_370]) ).
tff(c_409,plain,
less_or_equal(b,c),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_60,c_390]) ).
tff(c_44,plain,
! [Y_63,Z_62,X_61] :
( ~ less_or_equal(Y_63,Z_62)
| ~ less_or_equal(X_61,Y_63)
| less_or_equal(X_61,Z_62) ),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_623,plain,
! [X_149] :
( ~ less_or_equal(X_149,b)
| less_or_equal(X_149,c) ),
inference(resolution,[status(thm)],[c_409,c_44]) ).
tff(c_66,plain,
~ less_or_equal(additive_identity,c),
inference(cnfTransformation,[status(thm)],[f_256]) ).
tff(c_632,plain,
~ less_or_equal(additive_identity,b),
inference(resolution,[status(thm)],[c_623,c_66]) ).
tff(c_644,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_62,c_632]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD070-4 : 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.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 20:18:39 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.01/2.01 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.01/2.01
% 4.01/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.46/2.04
% 4.46/2.04 Inference rules
% 4.46/2.04 ----------------------
% 4.46/2.04 #Ref : 0
% 4.46/2.04 #Sup : 131
% 4.46/2.04 #Fact : 2
% 4.46/2.04 #Define : 0
% 4.46/2.04 #Split : 3
% 4.46/2.04 #Chain : 0
% 4.46/2.04 #Close : 0
% 4.46/2.04
% 4.46/2.04 Ordering : KBO
% 4.46/2.04
% 4.46/2.04 Simplification rules
% 4.46/2.04 ----------------------
% 4.46/2.04 #Subsume : 23
% 4.46/2.04 #Demod : 57
% 4.46/2.04 #Tautology : 19
% 4.46/2.04 #SimpNegUnit : 7
% 4.46/2.04 #BackRed : 0
% 4.46/2.04
% 4.46/2.04 #Partial instantiations: 0
% 4.46/2.04 #Strategies tried : 1
% 4.46/2.04
% 4.46/2.04 Timing (in seconds)
% 4.46/2.04 ----------------------
% 4.46/2.05 Preprocessing : 0.50
% 4.46/2.05 Parsing : 0.27
% 4.46/2.05 CNF conversion : 0.03
% 4.46/2.05 Main loop : 0.48
% 4.46/2.05 Inferencing : 0.20
% 4.46/2.05 Reduction : 0.11
% 4.46/2.05 Demodulation : 0.08
% 4.46/2.05 BG Simplification : 0.03
% 4.46/2.05 Subsumption : 0.11
% 4.46/2.05 Abstraction : 0.02
% 4.46/2.05 MUC search : 0.00
% 4.46/2.05 Cooper : 0.00
% 4.46/2.05 Total : 1.04
% 4.46/2.05 Index Insertion : 0.00
% 4.46/2.05 Index Deletion : 0.00
% 4.46/2.05 Index Matching : 0.00
% 4.46/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------