TSTP Solution File: FLD056-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD056-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 : n001.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:38 EDT 2023
% Result : Unsatisfiable 3.26s 1.76s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 20 ( 6 unt; 11 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 5 (; 5 !; 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_222,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X)
| ~ defined(Y) ),
file(unknown,unknown) ).
tff(f_251,axiom,
~ less_or_equal(a,a),
file(unknown,unknown) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_46,plain,
! [Y_65,X_64] :
( ~ defined(Y_65)
| ~ defined(X_64)
| less_or_equal(Y_65,X_64)
| less_or_equal(X_64,Y_65) ),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_115,plain,
! [Y_99] :
( ~ defined(Y_99)
| less_or_equal(Y_99,Y_99) ),
inference(factorization,[status(thm),theory(equality)],[c_46]) ).
tff(c_56,plain,
~ less_or_equal(a,a),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_120,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_115,c_56]) ).
tff(c_125,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : FLD056-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.15/0.36 % Computer : n001.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 20:30:25 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.26/1.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/1.77
% 3.26/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.35/1.79
% 3.35/1.79 Inference rules
% 3.35/1.79 ----------------------
% 3.35/1.79 #Ref : 0
% 3.35/1.79 #Sup : 11
% 3.35/1.79 #Fact : 2
% 3.35/1.79 #Define : 0
% 3.35/1.79 #Split : 0
% 3.35/1.79 #Chain : 0
% 3.35/1.79 #Close : 0
% 3.35/1.79
% 3.35/1.79 Ordering : KBO
% 3.35/1.79
% 3.35/1.79 Simplification rules
% 3.35/1.79 ----------------------
% 3.35/1.79 #Subsume : 3
% 3.35/1.79 #Demod : 1
% 3.35/1.79 #Tautology : 1
% 3.35/1.79 #SimpNegUnit : 0
% 3.35/1.79 #BackRed : 0
% 3.35/1.79
% 3.35/1.79 #Partial instantiations: 0
% 3.35/1.79 #Strategies tried : 1
% 3.35/1.79
% 3.35/1.79 Timing (in seconds)
% 3.35/1.79 ----------------------
% 3.35/1.80 Preprocessing : 0.48
% 3.35/1.80 Parsing : 0.26
% 3.35/1.80 CNF conversion : 0.03
% 3.35/1.80 Main loop : 0.26
% 3.35/1.80 Inferencing : 0.11
% 3.35/1.80 Reduction : 0.06
% 3.35/1.80 Demodulation : 0.04
% 3.35/1.80 BG Simplification : 0.02
% 3.35/1.80 Subsumption : 0.06
% 3.35/1.80 Abstraction : 0.01
% 3.35/1.80 MUC search : 0.00
% 3.35/1.80 Cooper : 0.00
% 3.35/1.80 Total : 0.78
% 3.35/1.80 Index Insertion : 0.00
% 3.35/1.80 Index Deletion : 0.00
% 3.35/1.80 Index Matching : 0.00
% 3.35/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------