TSTP Solution File: FLD006-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD006-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 : n026.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:26 EDT 2023
% Result : Unsatisfiable 3.10s 1.73s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 21 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > additive_identity
%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(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_159,axiom,
defined(additive_identity),
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_250,axiom,
~ sum(additive_identity,additive_inverse(additive_identity),additive_identity),
file(unknown,unknown) ).
tff(c_28,plain,
defined(additive_identity),
inference(cnfTransformation,[status(thm)],[f_159]) ).
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_60,plain,
! [X_80,Y_81,Z_82] :
( ~ sum(X_80,Y_81,Z_82)
| sum(Y_81,X_80,Z_82) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_71,plain,
! [X_84] :
( sum(X_84,additive_inverse(X_84),additive_identity)
| ~ defined(X_84) ),
inference(resolution,[status(thm)],[c_8,c_60]) ).
tff(c_54,plain,
~ sum(additive_identity,additive_inverse(additive_identity),additive_identity),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_76,plain,
~ defined(additive_identity),
inference(resolution,[status(thm)],[c_71,c_54]) ).
tff(c_81,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD006-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.13/0.35 % Computer : n026.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 20:13:17 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.10/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.10/1.74
% 3.10/1.74 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.10/1.76
% 3.10/1.76 Inference rules
% 3.10/1.76 ----------------------
% 3.10/1.76 #Ref : 0
% 3.10/1.76 #Sup : 5
% 3.10/1.76 #Fact : 0
% 3.10/1.76 #Define : 0
% 3.10/1.76 #Split : 0
% 3.10/1.76 #Chain : 0
% 3.10/1.76 #Close : 0
% 3.10/1.76
% 3.10/1.76 Ordering : KBO
% 3.10/1.76
% 3.10/1.76 Simplification rules
% 3.10/1.76 ----------------------
% 3.10/1.76 #Subsume : 2
% 3.10/1.76 #Demod : 1
% 3.10/1.76 #Tautology : 0
% 3.10/1.76 #SimpNegUnit : 0
% 3.10/1.76 #BackRed : 0
% 3.10/1.76
% 3.10/1.76 #Partial instantiations: 0
% 3.10/1.76 #Strategies tried : 1
% 3.10/1.76
% 3.10/1.76 Timing (in seconds)
% 3.10/1.76 ----------------------
% 3.10/1.76 Preprocessing : 0.49
% 3.10/1.76 Parsing : 0.27
% 3.10/1.76 CNF conversion : 0.03
% 3.10/1.76 Main loop : 0.21
% 3.10/1.76 Inferencing : 0.08
% 3.10/1.76 Reduction : 0.05
% 3.10/1.76 Demodulation : 0.04
% 3.10/1.77 BG Simplification : 0.02
% 3.10/1.77 Subsumption : 0.06
% 3.10/1.77 Abstraction : 0.01
% 3.10/1.77 MUC search : 0.00
% 3.10/1.77 Cooper : 0.00
% 3.10/1.77 Total : 0.75
% 3.10/1.77 Index Insertion : 0.00
% 3.10/1.77 Index Deletion : 0.00
% 3.10/1.77 Index Matching : 0.00
% 3.10/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------