TSTP Solution File: FLD056-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD056-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 : n032.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.57s 1.82s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 19 ( 6 unt; 10 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 : 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 : 5 (; 5 !; 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_236,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_173,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X)
| ~ defined(Y) ),
file(unknown,unknown) ).
tff(f_238,axiom,
~ less_or_equal(a,a),
file(unknown,unknown) ).
tff(c_56,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_236]) ).
tff(c_36,plain,
! [Y_30,X_29] :
( ~ defined(Y_30)
| ~ defined(X_29)
| less_or_equal(Y_30,X_29)
| less_or_equal(X_29,Y_30) ),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_167,plain,
! [Y_79] :
( ~ defined(Y_79)
| less_or_equal(Y_79,Y_79) ),
inference(factorization,[status(thm),theory(equality)],[c_36]) ).
tff(c_58,plain,
~ less_or_equal(a,a),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_174,plain,
~ defined(a),
inference(resolution,[status(thm)],[c_167,c_58]) ).
tff(c_180,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : FLD056-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.11 % 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.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Thu Aug 3 19:52:21 EDT 2023
% 0.09/0.30 % CPUTime :
% 3.57/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/1.82
% 3.57/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.57/1.85
% 3.57/1.85 Inference rules
% 3.57/1.85 ----------------------
% 3.57/1.85 #Ref : 0
% 3.57/1.85 #Sup : 28
% 3.57/1.85 #Fact : 2
% 3.57/1.85 #Define : 0
% 3.57/1.85 #Split : 0
% 3.57/1.85 #Chain : 0
% 3.57/1.85 #Close : 0
% 3.57/1.85
% 3.57/1.85 Ordering : KBO
% 3.57/1.85
% 3.57/1.85 Simplification rules
% 3.57/1.85 ----------------------
% 3.57/1.85 #Subsume : 5
% 3.57/1.85 #Demod : 1
% 3.57/1.85 #Tautology : 5
% 3.57/1.85 #SimpNegUnit : 0
% 3.57/1.85 #BackRed : 0
% 3.57/1.85
% 3.57/1.85 #Partial instantiations: 0
% 3.57/1.85 #Strategies tried : 1
% 3.57/1.85
% 3.57/1.85 Timing (in seconds)
% 3.57/1.85 ----------------------
% 3.57/1.85 Preprocessing : 0.53
% 3.57/1.85 Parsing : 0.28
% 3.57/1.85 CNF conversion : 0.04
% 3.57/1.85 Main loop : 0.33
% 3.57/1.85 Inferencing : 0.13
% 3.57/1.85 Reduction : 0.08
% 3.57/1.85 Demodulation : 0.05
% 3.57/1.85 BG Simplification : 0.02
% 3.57/1.85 Subsumption : 0.09
% 3.57/1.85 Abstraction : 0.01
% 3.57/1.85 MUC search : 0.00
% 3.57/1.85 Cooper : 0.00
% 3.57/1.85 Total : 0.92
% 3.57/1.85 Index Insertion : 0.00
% 3.57/1.85 Index Deletion : 0.00
% 3.57/1.86 Index Matching : 0.00
% 3.57/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------