TSTP Solution File: SYN014-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN014-2 : TPTP v8.1.2. Released v1.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 : n018.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 11:08:32 EDT 2023
% Result : Unsatisfiable 3.38s 1.91s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 7 |; 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 : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equalish > element > #nlpp > g > f > n > m > k > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $i ).
tff(a,type,
a: $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(k,type,
k: $i ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(n,type,
n: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_189,axiom,
equalish(m,k),
file(unknown,unknown) ).
tff(f_184,axiom,
equalish(n,k),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X,Y] :
( ~ equalish(X,Y)
| equalish(Y,X) ),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X,Y,Z] :
( ~ equalish(X,Y)
| ~ equalish(Y,Z)
| equalish(X,Z) ),
file(unknown,unknown) ).
tff(f_182,axiom,
~ equalish(m,n),
file(unknown,unknown) ).
tff(c_52,plain,
equalish(m,k),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_46,plain,
equalish(n,k),
inference(cnfTransformation,[status(thm)],[f_184]) ).
tff(c_54,plain,
! [Y_31,X_32] :
( equalish(Y_31,X_32)
| ~ equalish(X_32,Y_31) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_63,plain,
equalish(k,n),
inference(resolution,[status(thm)],[c_46,c_54]) ).
tff(c_85,plain,
! [X_34,Z_35,Y_36] :
( equalish(X_34,Z_35)
| ~ equalish(Y_36,Z_35)
| ~ equalish(X_34,Y_36) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_125,plain,
! [X_39] :
( equalish(X_39,n)
| ~ equalish(X_39,k) ),
inference(resolution,[status(thm)],[c_63,c_85]) ).
tff(c_44,plain,
~ equalish(m,n),
inference(cnfTransformation,[status(thm)],[f_182]) ).
tff(c_135,plain,
~ equalish(m,k),
inference(resolution,[status(thm)],[c_125,c_44]) ).
tff(c_142,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_52,c_135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN014-2 : TPTP v8.1.2. Released v1.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.18/0.35 % Computer : n018.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 17:31:35 EDT 2023
% 0.18/0.35 % CPUTime :
% 3.38/1.91 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.38/1.92
% 3.38/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/1.97
% 3.38/1.97 Inference rules
% 3.38/1.97 ----------------------
% 3.38/1.97 #Ref : 0
% 3.38/1.97 #Sup : 20
% 3.38/1.97 #Fact : 0
% 3.38/1.97 #Define : 0
% 3.38/1.97 #Split : 0
% 3.38/1.97 #Chain : 0
% 3.38/1.97 #Close : 0
% 3.38/1.97
% 3.38/1.97 Ordering : KBO
% 3.38/1.97
% 3.38/1.97 Simplification rules
% 3.38/1.97 ----------------------
% 3.38/1.97 #Subsume : 1
% 3.38/1.97 #Demod : 10
% 3.38/1.97 #Tautology : 11
% 3.38/1.97 #SimpNegUnit : 0
% 3.38/1.97 #BackRed : 0
% 3.38/1.97
% 3.38/1.97 #Partial instantiations: 0
% 3.38/1.97 #Strategies tried : 1
% 3.38/1.97
% 3.38/1.97 Timing (in seconds)
% 3.38/1.97 ----------------------
% 3.38/1.97 Preprocessing : 0.58
% 3.38/1.97 Parsing : 0.34
% 3.38/1.97 CNF conversion : 0.03
% 3.38/1.97 Main loop : 0.31
% 3.38/1.97 Inferencing : 0.11
% 3.38/1.97 Reduction : 0.09
% 3.38/1.97 Demodulation : 0.06
% 3.38/1.97 BG Simplification : 0.03
% 3.38/1.97 Subsumption : 0.08
% 3.38/1.97 Abstraction : 0.01
% 3.38/1.97 MUC search : 0.00
% 3.38/1.97 Cooper : 0.00
% 3.38/1.97 Total : 0.97
% 3.38/1.97 Index Insertion : 0.00
% 3.38/1.97 Index Deletion : 0.00
% 3.38/1.97 Index Matching : 0.00
% 3.38/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------