TSTP Solution File: NUM027-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.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 : n014.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:50:52 EDT 2023
% Result : Unsatisfiable 4.31s 2.02s
% Output : CNFRefutation 4.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 39 ( 16 unt; 10 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 42 ( 23 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 29 (; 29 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > equalish > predecessor_of_1st_minus_2nd > multiply > add > #nlpp > successor > n0 > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(predecessor_of_1st_minus_2nd,type,
predecessor_of_1st_minus_2nd: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(successor,type,
successor: $i > $i ).
tff(c,type,
c: $i ).
tff(f_156,axiom,
~ equalish(c,n0),
file(unknown,unknown) ).
tff(f_138,axiom,
! [A,B] :
( less(A,B)
| equalish(B,A)
| less(B,A) ),
file(unknown,unknown) ).
tff(f_153,axiom,
~ less(b,a),
file(unknown,unknown) ).
tff(f_151,axiom,
! [A,B,C] :
( ~ less(A,B)
| equalish(C,n0)
| less(multiply(A,C),multiply(B,C)) ),
file(unknown,unknown) ).
tff(f_154,axiom,
less(multiply(b,c),multiply(a,c)),
file(unknown,unknown) ).
tff(f_94,axiom,
! [A,B,C] :
( ~ less(A,B)
| ~ less(C,A)
| less(C,B) ),
file(unknown,unknown) ).
tff(f_141,axiom,
! [A] : ~ less(A,A),
file(unknown,unknown) ).
tff(f_126,axiom,
! [A,B,C] :
( ~ equalish(A,B)
| equalish(multiply(A,C),multiply(B,C)) ),
file(unknown,unknown) ).
tff(f_132,axiom,
! [A,B] :
( ~ less(A,B)
| ~ equalish(A,B) ),
file(unknown,unknown) ).
tff(c_42,plain,
~ equalish(c,n0),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_107,plain,
! [B_52,A_53] :
( less(B_52,A_53)
| equalish(B_52,A_53)
| less(A_53,B_52) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_38,plain,
~ less(b,a),
inference(cnfTransformation,[status(thm)],[f_153]) ).
tff(c_125,plain,
( equalish(b,a)
| less(a,b) ),
inference(resolution,[status(thm)],[c_107,c_38]) ).
tff(c_128,plain,
less(a,b),
inference(splitLeft,[status(thm)],[c_125]) ).
tff(c_36,plain,
! [A_34,C_36,B_35] :
( less(multiply(A_34,C_36),multiply(B_35,C_36))
| equalish(C_36,n0)
| ~ less(A_34,B_35) ),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_40,plain,
less(multiply(b,c),multiply(a,c)),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_233,plain,
! [C_71,B_72,A_73] :
( less(C_71,B_72)
| ~ less(C_71,A_73)
| ~ less(A_73,B_72) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_716,plain,
! [B_131] :
( less(multiply(b,c),B_131)
| ~ less(multiply(a,c),B_131) ),
inference(resolution,[status(thm)],[c_40,c_233]) ).
tff(c_32,plain,
! [A_32] : ~ less(A_32,A_32),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_728,plain,
~ less(multiply(a,c),multiply(b,c)),
inference(resolution,[status(thm)],[c_716,c_32]) ).
tff(c_744,plain,
( equalish(c,n0)
| ~ less(a,b) ),
inference(resolution,[status(thm)],[c_36,c_728]) ).
tff(c_749,plain,
equalish(c,n0),
inference(demodulation,[status(thm),theory(equality)],[c_128,c_744]) ).
tff(c_751,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_749]) ).
tff(c_752,plain,
equalish(b,a),
inference(splitRight,[status(thm)],[c_125]) ).
tff(c_903,plain,
! [A_154,C_155,B_156] :
( equalish(multiply(A_154,C_155),multiply(B_156,C_155))
| ~ equalish(A_154,B_156) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_28,plain,
! [A_28,B_29] :
( ~ equalish(A_28,B_29)
| ~ less(A_28,B_29) ),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_73,plain,
~ equalish(multiply(b,c),multiply(a,c)),
inference(resolution,[status(thm)],[c_40,c_28]) ).
tff(c_908,plain,
~ equalish(b,a),
inference(resolution,[status(thm)],[c_903,c_73]) ).
tff(c_915,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_752,c_908]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM027-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.13 % 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.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 14:48:48 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.31/2.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.31/2.03
% 4.31/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.31/2.06
% 4.31/2.06 Inference rules
% 4.31/2.06 ----------------------
% 4.31/2.06 #Ref : 0
% 4.31/2.06 #Sup : 190
% 4.31/2.06 #Fact : 2
% 4.31/2.06 #Define : 0
% 4.31/2.06 #Split : 1
% 4.31/2.06 #Chain : 0
% 4.31/2.06 #Close : 0
% 4.31/2.06
% 4.31/2.06 Ordering : KBO
% 4.31/2.06
% 4.31/2.06 Simplification rules
% 4.31/2.06 ----------------------
% 4.31/2.06 #Subsume : 15
% 4.31/2.06 #Demod : 37
% 4.31/2.06 #Tautology : 42
% 4.31/2.06 #SimpNegUnit : 5
% 4.31/2.06 #BackRed : 0
% 4.31/2.06
% 4.31/2.06 #Partial instantiations: 0
% 4.31/2.06 #Strategies tried : 1
% 4.31/2.06
% 4.31/2.06 Timing (in seconds)
% 4.31/2.06 ----------------------
% 4.31/2.06 Preprocessing : 0.46
% 4.31/2.06 Parsing : 0.24
% 4.31/2.06 CNF conversion : 0.03
% 4.31/2.06 Main loop : 0.54
% 4.31/2.06 Inferencing : 0.22
% 4.31/2.06 Reduction : 0.14
% 4.31/2.06 Demodulation : 0.10
% 4.31/2.06 BG Simplification : 0.02
% 4.31/2.06 Subsumption : 0.12
% 4.31/2.06 Abstraction : 0.02
% 4.31/2.06 MUC search : 0.00
% 4.31/2.06 Cooper : 0.00
% 4.31/2.06 Total : 1.05
% 4.31/2.06 Index Insertion : 0.00
% 4.31/2.06 Index Deletion : 0.00
% 4.31/2.06 Index Matching : 0.00
% 4.31/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------