TSTP Solution File: NUM019-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM019-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 : n015.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:51 EDT 2023
% Result : Unsatisfiable 2.80s 1.77s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 8 unt; 7 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 : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equalish > multiply > add > #nlpp > successor > n0 > aa > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(successor,type,
successor: $i > $i ).
tff(aa,type,
aa: $i ).
tff(f_83,axiom,
~ equalish(aa,a),
file(unknown,unknown) ).
tff(f_81,axiom,
equalish(a,aa),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X] : equalish(X,X),
file(unknown,unknown) ).
tff(f_77,axiom,
! [X,Y,Z] :
( ~ equalish(X,Y)
| ~ equalish(X,Z)
| equalish(Y,Z) ),
file(unknown,unknown) ).
tff(c_22,plain,
~ equalish(aa,a),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_20,plain,
equalish(a,aa),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_14,plain,
! [X_11] : equalish(X_11,X_11),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_39,plain,
! [Y_24,Z_25,X_26] :
( equalish(Y_24,Z_25)
| ~ equalish(X_26,Z_25)
| ~ equalish(X_26,Y_24) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_59,plain,
! [Y_29,X_30] :
( equalish(Y_29,X_30)
| ~ equalish(X_30,Y_29) ),
inference(resolution,[status(thm)],[c_14,c_39]) ).
tff(c_71,plain,
equalish(aa,a),
inference(resolution,[status(thm)],[c_20,c_59]) ).
tff(c_81,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM019-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/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.18/0.36 % Computer : n015.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 15:23:29 EDT 2023
% 0.18/0.36 % CPUTime :
% 2.80/1.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/1.78
% 2.80/1.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.80/1.81
% 2.80/1.81 Inference rules
% 2.80/1.81 ----------------------
% 2.80/1.81 #Ref : 0
% 2.80/1.81 #Sup : 14
% 2.80/1.81 #Fact : 0
% 2.80/1.81 #Define : 0
% 2.80/1.81 #Split : 0
% 2.80/1.81 #Chain : 0
% 2.80/1.81 #Close : 0
% 2.80/1.81
% 2.80/1.81 Ordering : KBO
% 2.80/1.81
% 2.80/1.81 Simplification rules
% 2.80/1.81 ----------------------
% 2.80/1.81 #Subsume : 0
% 2.80/1.81 #Demod : 2
% 2.80/1.81 #Tautology : 3
% 2.80/1.81 #SimpNegUnit : 1
% 2.80/1.81 #BackRed : 0
% 2.80/1.81
% 2.80/1.81 #Partial instantiations: 0
% 2.80/1.81 #Strategies tried : 1
% 2.80/1.81
% 2.80/1.81 Timing (in seconds)
% 2.80/1.81 ----------------------
% 2.80/1.81 Preprocessing : 0.43
% 2.80/1.81 Parsing : 0.23
% 2.80/1.81 CNF conversion : 0.02
% 2.80/1.81 Main loop : 0.19
% 2.80/1.81 Inferencing : 0.07
% 2.80/1.81 Reduction : 0.05
% 2.80/1.81 Demodulation : 0.04
% 2.80/1.81 BG Simplification : 0.01
% 2.80/1.81 Subsumption : 0.04
% 2.80/1.81 Abstraction : 0.01
% 2.80/1.81 MUC search : 0.00
% 2.80/1.81 Cooper : 0.00
% 2.80/1.81 Total : 0.66
% 2.80/1.81 Index Insertion : 0.00
% 2.80/1.81 Index Deletion : 0.00
% 2.80/1.81 Index Matching : 0.00
% 2.80/1.81 BG Taut test : 0.00
%------------------------------------------------------------------------------