TSTP Solution File: FLD064-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD064-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 : n008.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:40 EDT 2023
% Result : Unsatisfiable 98.90s 84.41s
% Output : CNFRefutation 98.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 42 ( 13 unt; 11 typ; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 35 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > 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(defined,type,
defined: $i > $o ).
tff(multiplicative_inverse,type,
multiplicative_inverse: $i > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_164,axiom,
! [X] :
( defined(additive_inverse(X))
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_159,axiom,
defined(additive_identity),
file(unknown,unknown) ).
tff(f_222,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X)
| ~ defined(Y) ),
file(unknown,unknown) ).
tff(f_252,axiom,
~ less_or_equal(additive_inverse(a),additive_identity),
file(unknown,unknown) ).
tff(f_250,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_78,axiom,
! [X] :
( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_83,axiom,
! [Y,X,Z] :
( sum(Y,X,Z)
| ~ sum(X,Y,Z) ),
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(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_30,plain,
! [X_51] :
( ~ defined(X_51)
| defined(additive_inverse(X_51)) ),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_28,plain,
defined(additive_identity),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_125,plain,
! [Y_102,X_103] :
( ~ defined(Y_102)
| ~ defined(X_103)
| less_or_equal(Y_102,X_103)
| less_or_equal(X_103,Y_102) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_58,plain,
~ less_or_equal(additive_inverse(a),additive_identity),
inference(cnfTransformation,[status(thm)],[f_252]) ).
tff(c_135,plain,
( ~ defined(additive_inverse(a))
| ~ defined(additive_identity)
| less_or_equal(additive_identity,additive_inverse(a)) ),
inference(resolution,[status(thm)],[c_125,c_58]) ).
tff(c_152,plain,
( ~ defined(additive_inverse(a))
| less_or_equal(additive_identity,additive_inverse(a)) ),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_135]) ).
tff(c_171,plain,
~ defined(additive_inverse(a)),
inference(splitLeft,[status(thm)],[c_152]) ).
tff(c_178,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_30,c_171]) ).
tff(c_182,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_178]) ).
tff(c_184,plain,
defined(additive_inverse(a)),
inference(splitRight,[status(thm)],[c_152]) ).
tff(c_56,plain,
less_or_equal(additive_identity,a),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_6,plain,
! [X_13] :
( ~ defined(X_13)
| sum(additive_identity,X_13,X_13) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_8,plain,
! [X_14] :
( ~ defined(X_14)
| sum(additive_inverse(X_14),X_14,additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_72,plain,
! [X_84,Y_85,Z_86] :
( ~ sum(X_84,Y_85,Z_86)
| sum(Y_85,X_84,Z_86) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_77,plain,
! [X_14] :
( sum(X_14,additive_inverse(X_14),additive_identity)
| ~ defined(X_14) ),
inference(resolution,[status(thm)],[c_8,c_72]) ).
tff(c_315,plain,
! [U_123,X_124,Z_125,V_127,Y_126] :
( ~ sum(Y_126,Z_125,V_127)
| ~ sum(X_124,Z_125,U_123)
| ~ less_or_equal(X_124,Y_126)
| less_or_equal(U_123,V_127) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_27760,plain,
! [X_549,X_550,U_551] :
( ~ sum(X_549,additive_inverse(X_550),U_551)
| ~ less_or_equal(X_549,X_550)
| less_or_equal(U_551,additive_identity)
| ~ defined(X_550) ),
inference(resolution,[status(thm)],[c_77,c_315]) ).
tff(c_224328,plain,
! [X_1501] :
( ~ less_or_equal(additive_identity,X_1501)
| less_or_equal(additive_inverse(X_1501),additive_identity)
| ~ defined(X_1501)
| ~ defined(additive_inverse(X_1501)) ),
inference(resolution,[status(thm)],[c_6,c_27760]) ).
tff(c_224406,plain,
( ~ less_or_equal(additive_identity,a)
| ~ defined(a)
| ~ defined(additive_inverse(a)) ),
inference(resolution,[status(thm)],[c_224328,c_58]) ).
tff(c_224477,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_184,c_54,c_56,c_224406]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD064-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n008.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:03:04 EDT 2023
% 0.14/0.35 % CPUTime :
% 98.90/84.41 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 98.90/84.42
% 98.90/84.42 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 98.99/84.45
% 98.99/84.45 Inference rules
% 98.99/84.45 ----------------------
% 98.99/84.45 #Ref : 0
% 98.99/84.45 #Sup : 47941
% 98.99/84.45 #Fact : 20
% 98.99/84.45 #Define : 0
% 98.99/84.45 #Split : 26
% 98.99/84.45 #Chain : 0
% 98.99/84.45 #Close : 0
% 98.99/84.45
% 98.99/84.45 Ordering : KBO
% 98.99/84.45
% 98.99/84.45 Simplification rules
% 98.99/84.45 ----------------------
% 98.99/84.45 #Subsume : 4928
% 98.99/84.45 #Demod : 40204
% 98.99/84.45 #Tautology : 9059
% 98.99/84.45 #SimpNegUnit : 3021
% 98.99/84.45 #BackRed : 0
% 98.99/84.45
% 98.99/84.45 #Partial instantiations: 0
% 98.99/84.45 #Strategies tried : 1
% 98.99/84.45
% 98.99/84.45 Timing (in seconds)
% 98.99/84.45 ----------------------
% 98.99/84.45 Preprocessing : 0.49
% 98.99/84.45 Parsing : 0.27
% 98.99/84.45 CNF conversion : 0.03
% 98.99/84.45 Main loop : 82.88
% 98.99/84.45 Inferencing : 5.60
% 98.99/84.45 Reduction : 42.32
% 98.99/84.45 Demodulation : 37.10
% 98.99/84.45 BG Simplification : 0.30
% 98.99/84.45 Subsumption : 30.18
% 98.99/84.45 Abstraction : 0.41
% 98.99/84.45 MUC search : 0.00
% 98.99/84.45 Cooper : 0.00
% 98.99/84.45 Total : 83.43
% 98.99/84.45 Index Insertion : 0.00
% 98.99/84.45 Index Deletion : 0.00
% 98.99/84.45 Index Matching : 0.00
% 98.99/84.45 BG Taut test : 0.00
%------------------------------------------------------------------------------