TSTP Solution File: NUM025-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM025-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/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 : n016.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 2.81s 1.72s
% Output : CNFRefutation 3.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 20 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 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 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 9 (; 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > equalish > predecessor_of_1st_minus_2nd > multiply > add > #nlpp > successor > n0 > 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(f_127,axiom,
! [A] : ~ less(A,A),
file(unknown,unknown) ).
tff(f_129,axiom,
less(b,a),
file(unknown,unknown) ).
tff(f_128,axiom,
less(a,b),
file(unknown,unknown) ).
tff(f_94,axiom,
! [A,B,C] :
( ~ less(A,B)
| ~ less(C,A)
| less(C,B) ),
file(unknown,unknown) ).
tff(c_28,plain,
! [A_26] : ~ less(A_26,A_26),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_32,plain,
less(b,a),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_30,plain,
less(a,b),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_82,plain,
! [C_42,B_43,A_44] :
( less(C_42,B_43)
| ~ less(C_42,A_44)
| ~ less(A_44,B_43) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_89,plain,
! [B_45] :
( less(a,B_45)
| ~ less(b,B_45) ),
inference(resolution,[status(thm)],[c_30,c_82]) ).
tff(c_92,plain,
less(a,a),
inference(resolution,[status(thm)],[c_32,c_89]) ).
tff(c_96,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM025-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.14 % 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.16/0.35 % Computer : n016.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 15:02:52 EDT 2023
% 0.16/0.36 % CPUTime :
% 2.81/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.81/1.72
% 2.81/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.04/1.74
% 3.04/1.74 Inference rules
% 3.04/1.75 ----------------------
% 3.04/1.75 #Ref : 0
% 3.04/1.75 #Sup : 13
% 3.04/1.75 #Fact : 0
% 3.04/1.75 #Define : 0
% 3.04/1.75 #Split : 0
% 3.04/1.75 #Chain : 0
% 3.04/1.75 #Close : 0
% 3.04/1.75
% 3.04/1.75 Ordering : KBO
% 3.04/1.75
% 3.04/1.75 Simplification rules
% 3.04/1.75 ----------------------
% 3.04/1.75 #Subsume : 2
% 3.04/1.75 #Demod : 4
% 3.04/1.75 #Tautology : 5
% 3.04/1.75 #SimpNegUnit : 1
% 3.04/1.75 #BackRed : 0
% 3.04/1.75
% 3.04/1.75 #Partial instantiations: 0
% 3.04/1.75 #Strategies tried : 1
% 3.04/1.75
% 3.04/1.75 Timing (in seconds)
% 3.04/1.75 ----------------------
% 3.04/1.75 Preprocessing : 0.45
% 3.04/1.75 Parsing : 0.24
% 3.04/1.75 CNF conversion : 0.02
% 3.04/1.75 Main loop : 0.22
% 3.04/1.75 Inferencing : 0.09
% 3.04/1.75 Reduction : 0.06
% 3.04/1.75 Demodulation : 0.04
% 3.04/1.75 BG Simplification : 0.01
% 3.04/1.75 Subsumption : 0.05
% 3.04/1.75 Abstraction : 0.01
% 3.04/1.75 MUC search : 0.00
% 3.04/1.75 Cooper : 0.00
% 3.04/1.75 Total : 0.72
% 3.04/1.75 Index Insertion : 0.00
% 3.04/1.75 Index Deletion : 0.00
% 3.04/1.75 Index Matching : 0.00
% 3.04/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------