TSTP Solution File: FLD001-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : FLD001-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 : n012.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:25 EDT 2023
% Result : Unsatisfiable 16.27s 6.30s
% Output : CNFRefutation 16.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 41 ( 14 unt; 12 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 58 ( 31 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > less_or_equal > defined > multiply > add > #nlpp > multiplicative_inverse > additive_inverse > multiplicative_identity > 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(f_253,axiom,
~ product(multiplicative_identity,a,b),
file(unknown,unknown) ).
tff(f_159,axiom,
defined(additive_identity),
file(unknown,unknown) ).
tff(f_110,axiom,
! [X] :
( product(multiplicative_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_122,axiom,
! [Y,X,Z] :
( product(Y,X,Z)
| ~ product(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_249,axiom,
defined(a),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X] :
( sum(additive_identity,X,X)
| ~ defined(X) ),
file(unknown,unknown) ).
tff(f_251,axiom,
sum(additive_identity,a,b),
file(unknown,unknown) ).
tff(f_150,axiom,
! [A,Z,B,C,X,Y,D] :
( product(A,Z,B)
| ~ sum(X,Y,A)
| ~ product(X,Z,C)
| ~ product(Y,Z,D)
| ~ sum(C,D,B) ),
file(unknown,unknown) ).
tff(c_60,plain,
~ product(multiplicative_identity,a,b),
inference(cnfTransformation,[status(thm)],[f_253]) ).
tff(c_28,plain,
defined(additive_identity),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_16,plain,
! [X_30] :
( ~ defined(X_30)
| product(multiplicative_identity,X_30,X_30) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_66,plain,
! [X_80,Y_81,Z_82] :
( ~ product(X_80,Y_81,Z_82)
| product(Y_81,X_80,Z_82) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_69,plain,
! [X_30] :
( product(X_30,multiplicative_identity,X_30)
| ~ defined(X_30) ),
inference(resolution,[status(thm)],[c_16,c_66]) ).
tff(c_54,plain,
defined(a),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_6,plain,
! [X_13] :
( ~ defined(X_13)
| sum(additive_identity,X_13,X_13) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_58,plain,
sum(additive_identity,a,b),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_474,plain,
! [A_152,B_155,X_156,C_151,Z_153,Y_150,D_154] :
( ~ sum(C_151,D_154,B_155)
| ~ product(Y_150,Z_153,D_154)
| ~ product(X_156,Z_153,C_151)
| ~ sum(X_156,Y_150,A_152)
| product(A_152,Z_153,B_155) ),
inference(cnfTransformation,[status(thm)],[f_150]) ).
tff(c_5783,plain,
! [Y_279,Z_280,X_281,A_282] :
( ~ product(Y_279,Z_280,a)
| ~ product(X_281,Z_280,additive_identity)
| ~ sum(X_281,Y_279,A_282)
| product(A_282,Z_280,b) ),
inference(resolution,[status(thm)],[c_58,c_474]) ).
tff(c_5792,plain,
! [X_281,A_282] :
( ~ product(X_281,multiplicative_identity,additive_identity)
| ~ sum(X_281,a,A_282)
| product(A_282,multiplicative_identity,b)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_69,c_5783]) ).
tff(c_24568,plain,
! [X_463,A_464] :
( ~ product(X_463,multiplicative_identity,additive_identity)
| ~ sum(X_463,a,A_464)
| product(A_464,multiplicative_identity,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_5792]) ).
tff(c_24720,plain,
( ~ product(additive_identity,multiplicative_identity,additive_identity)
| product(a,multiplicative_identity,b)
| ~ defined(a) ),
inference(resolution,[status(thm)],[c_6,c_24568]) ).
tff(c_24791,plain,
( ~ product(additive_identity,multiplicative_identity,additive_identity)
| product(a,multiplicative_identity,b) ),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_24720]) ).
tff(c_24793,plain,
~ product(additive_identity,multiplicative_identity,additive_identity),
inference(splitLeft,[status(thm)],[c_24791]) ).
tff(c_24796,plain,
~ defined(additive_identity),
inference(resolution,[status(thm)],[c_69,c_24793]) ).
tff(c_24800,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_24796]) ).
tff(c_24801,plain,
product(a,multiplicative_identity,b),
inference(splitRight,[status(thm)],[c_24791]) ).
tff(c_20,plain,
! [X_33,Y_32,Z_34] :
( ~ product(X_33,Y_32,Z_34)
| product(Y_32,X_33,Z_34) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_24839,plain,
product(multiplicative_identity,a,b),
inference(resolution,[status(thm)],[c_24801,c_20]) ).
tff(c_24886,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_24839]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD001-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 : n012.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 19:45:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 16.27/6.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.27/6.31
% 16.27/6.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 16.27/6.34
% 16.27/6.34 Inference rules
% 16.27/6.34 ----------------------
% 16.27/6.34 #Ref : 0
% 16.27/6.34 #Sup : 5734
% 16.27/6.34 #Fact : 8
% 16.27/6.34 #Define : 0
% 16.27/6.34 #Split : 18
% 16.27/6.34 #Chain : 0
% 16.27/6.34 #Close : 0
% 16.27/6.34
% 16.27/6.34 Ordering : KBO
% 16.27/6.34
% 16.27/6.34 Simplification rules
% 16.27/6.34 ----------------------
% 16.27/6.34 #Subsume : 489
% 16.27/6.34 #Demod : 3539
% 16.27/6.34 #Tautology : 986
% 16.27/6.34 #SimpNegUnit : 119
% 16.27/6.34 #BackRed : 0
% 16.27/6.34
% 16.27/6.34 #Partial instantiations: 0
% 16.27/6.34 #Strategies tried : 1
% 16.27/6.34
% 16.27/6.34 Timing (in seconds)
% 16.27/6.34 ----------------------
% 16.27/6.34 Preprocessing : 0.49
% 16.27/6.34 Parsing : 0.27
% 16.27/6.34 CNF conversion : 0.03
% 16.27/6.34 Main loop : 4.78
% 16.27/6.34 Inferencing : 0.97
% 16.27/6.34 Reduction : 1.89
% 16.27/6.34 Demodulation : 1.51
% 16.27/6.34 BG Simplification : 0.07
% 16.27/6.34 Subsumption : 1.51
% 16.27/6.34 Abstraction : 0.08
% 16.27/6.34 MUC search : 0.00
% 16.27/6.34 Cooper : 0.00
% 16.27/6.34 Total : 5.32
% 16.27/6.35 Index Insertion : 0.00
% 16.27/6.35 Index Deletion : 0.00
% 16.27/6.35 Index Matching : 0.00
% 16.27/6.35 BG Taut test : 0.00
%------------------------------------------------------------------------------