TSTP Solution File: SYN013-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN013-1 : 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/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 11:08:31 EDT 2023
% Result : Unsatisfiable 3.28s 1.78s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 71 ( 23 unt; 6 typ; 0 def)
% Number of atoms : 165 ( 97 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 153 ( 53 ~; 100 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > g > f > n > m > k
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m,type,
m: $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(f_33,axiom,
n != k,
file(unknown,unknown) ).
tff(f_31,axiom,
m != n,
file(unknown,unknown) ).
tff(f_35,axiom,
k != m,
file(unknown,unknown) ).
tff(f_134,axiom,
! [Y] :
( ( Y = k )
| ( Y != n )
| element(Y,k) ),
file(unknown,unknown) ).
tff(f_79,axiom,
! [Y,V] :
( ( Y = m )
| element(Y,m)
| ( V = m )
| ( V = Y )
| ~ element(Y,V)
| ~ element(V,Y) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [Y] :
( ( Y = m )
| ~ element(Y,m)
| element(f(Y),Y) ),
file(unknown,unknown) ).
tff(f_143,axiom,
! [Y] :
( ( Y = k )
| ( Y = m )
| ( Y = n )
| ~ element(Y,k) ),
file(unknown,unknown) ).
tff(f_93,axiom,
! [Y] :
( ( Y = n )
| element(Y,n)
| ( g(Y) != Y ) ),
file(unknown,unknown) ).
tff(f_86,axiom,
! [Y] :
( ( Y = n )
| element(Y,n)
| ( g(Y) != n ) ),
file(unknown,unknown) ).
tff(f_105,axiom,
! [Y] :
( ( Y = n )
| element(Y,n)
| element(g(Y),Y) ),
file(unknown,unknown) ).
tff(f_99,axiom,
! [Y] :
( ( Y = n )
| element(Y,n)
| element(Y,g(Y)) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [Y] :
( ( Y = m )
| ~ element(Y,m)
| ( f(Y) != m ) ),
file(unknown,unknown) ).
tff(f_51,axiom,
! [Y] :
( ( Y = m )
| ~ element(Y,m)
| ( f(Y) != Y ) ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [Y] :
( ( Y = m )
| ~ element(Y,m)
| element(Y,f(Y)) ),
file(unknown,unknown) ).
tff(f_127,axiom,
! [Y] :
( ( Y = k )
| ( Y != m )
| element(Y,k) ),
file(unknown,unknown) ).
tff(f_120,axiom,
! [Y,V] :
( ( Y = n )
| ~ element(Y,n)
| ( V = n )
| ( V = Y )
| ~ element(Y,V)
| ~ element(V,Y) ),
file(unknown,unknown) ).
tff(c_4,plain,
n != k,
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
n != m,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_6,plain,
m != k,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_30,plain,
( element(n,k)
| ( n = k ) ),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_34,plain,
element(n,k),
inference(negUnitSimplification,[status(thm)],[c_4,c_30]) ).
tff(c_99,plain,
! [V_25,Y_26] :
( ~ element(V_25,Y_26)
| ~ element(Y_26,V_25)
| ( Y_26 = V_25 )
| ( m = V_25 )
| element(Y_26,m)
| ( m = Y_26 ) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_115,plain,
( ~ element(k,n)
| ( n = k )
| ( n = m )
| element(k,m)
| ( m = k ) ),
inference(resolution,[status(thm)],[c_34,c_99]) ).
tff(c_132,plain,
( ~ element(k,n)
| element(k,m) ),
inference(negUnitSimplification,[status(thm)],[c_6,c_2,c_4,c_115]) ).
tff(c_133,plain,
~ element(k,n),
inference(splitLeft,[status(thm)],[c_132]) ).
tff(c_14,plain,
! [Y_4] :
( element(f(Y_4),Y_4)
| ~ element(Y_4,m)
| ( m = Y_4 ) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_68,plain,
! [Y_23] :
( ~ element(Y_23,k)
| ( n = Y_23 )
| ( m = Y_23 )
| ( k = Y_23 ) ),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_76,plain,
( ( f(k) = n )
| ( f(k) = m )
| ( f(k) = k )
| ~ element(k,m)
| ( m = k ) ),
inference(resolution,[status(thm)],[c_14,c_68]) ).
tff(c_88,plain,
( ( f(k) = n )
| ( f(k) = m )
| ( f(k) = k )
| ~ element(k,m) ),
inference(negUnitSimplification,[status(thm)],[c_6,c_76]) ).
tff(c_192,plain,
~ element(k,m),
inference(splitLeft,[status(thm)],[c_88]) ).
tff(c_20,plain,
! [Y_8] :
( ( g(Y_8) != Y_8 )
| element(Y_8,n)
| ( n = Y_8 ) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_136,plain,
( ( g(k) != k )
| ( n = k ) ),
inference(resolution,[status(thm)],[c_20,c_133]) ).
tff(c_142,plain,
g(k) != k,
inference(negUnitSimplification,[status(thm)],[c_4,c_136]) ).
tff(c_18,plain,
! [Y_7] :
( ( g(Y_7) != n )
| element(Y_7,n)
| ( n = Y_7 ) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_139,plain,
( ( g(k) != n )
| ( n = k ) ),
inference(resolution,[status(thm)],[c_18,c_133]) ).
tff(c_145,plain,
g(k) != n,
inference(negUnitSimplification,[status(thm)],[c_4,c_139]) ).
tff(c_24,plain,
! [Y_10] :
( element(g(Y_10),Y_10)
| element(Y_10,n)
| ( n = Y_10 ) ),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_72,plain,
( ( g(k) = n )
| ( g(k) = m )
| ( g(k) = k )
| element(k,n)
| ( n = k ) ),
inference(resolution,[status(thm)],[c_24,c_68]) ).
tff(c_85,plain,
( ( g(k) = n )
| ( g(k) = m )
| ( g(k) = k )
| element(k,n) ),
inference(negUnitSimplification,[status(thm)],[c_4,c_72]) ).
tff(c_176,plain,
g(k) = m,
inference(negUnitSimplification,[status(thm)],[c_133,c_142,c_145,c_85]) ).
tff(c_22,plain,
! [Y_9] :
( element(Y_9,g(Y_9))
| element(Y_9,n)
| ( n = Y_9 ) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_185,plain,
( element(k,m)
| element(k,n)
| ( n = k ) ),
inference(superposition,[status(thm),theory(equality)],[c_176,c_22]) ).
tff(c_190,plain,
element(k,m),
inference(negUnitSimplification,[status(thm)],[c_4,c_133,c_185]) ).
tff(c_193,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_192,c_190]) ).
tff(c_195,plain,
element(k,m),
inference(splitRight,[status(thm)],[c_88]) ).
tff(c_8,plain,
! [Y_1] :
( ( f(Y_1) != m )
| ~ element(Y_1,m)
| ( m = Y_1 ) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_205,plain,
( ( f(k) != m )
| ( m = k ) ),
inference(resolution,[status(thm)],[c_195,c_8]) ).
tff(c_220,plain,
f(k) != m,
inference(negUnitSimplification,[status(thm)],[c_6,c_205]) ).
tff(c_10,plain,
! [Y_2] :
( ( f(Y_2) != Y_2 )
| ~ element(Y_2,m)
| ( m = Y_2 ) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_202,plain,
( ( f(k) != k )
| ( m = k ) ),
inference(resolution,[status(thm)],[c_195,c_10]) ).
tff(c_217,plain,
f(k) != k,
inference(negUnitSimplification,[status(thm)],[c_6,c_202]) ).
tff(c_194,plain,
( ( f(k) = k )
| ( f(k) = m )
| ( f(k) = n ) ),
inference(splitRight,[status(thm)],[c_88]) ).
tff(c_234,plain,
f(k) = n,
inference(negUnitSimplification,[status(thm)],[c_220,c_217,c_194]) ).
tff(c_12,plain,
! [Y_3] :
( element(Y_3,f(Y_3))
| ~ element(Y_3,m)
| ( m = Y_3 ) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_240,plain,
( element(k,n)
| ~ element(k,m)
| ( m = k ) ),
inference(superposition,[status(thm),theory(equality)],[c_234,c_12]) ).
tff(c_247,plain,
( element(k,n)
| ( m = k ) ),
inference(demodulation,[status(thm),theory(equality)],[c_195,c_240]) ).
tff(c_249,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_133,c_247]) ).
tff(c_251,plain,
element(k,n),
inference(splitRight,[status(thm)],[c_132]) ).
tff(c_250,plain,
element(k,m),
inference(splitRight,[status(thm)],[c_132]) ).
tff(c_28,plain,
( element(m,k)
| ( m = k ) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_33,plain,
element(m,k),
inference(negUnitSimplification,[status(thm)],[c_6,c_28]) ).
tff(c_277,plain,
! [V_29,Y_30] :
( ~ element(V_29,Y_30)
| ~ element(Y_30,V_29)
| ( Y_30 = V_29 )
| ( n = V_29 )
| ~ element(Y_30,n)
| ( n = Y_30 ) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_295,plain,
( ~ element(k,m)
| ( m = k )
| ( n = m )
| ~ element(k,n)
| ( n = k ) ),
inference(resolution,[status(thm)],[c_33,c_277]) ).
tff(c_317,plain,
( ( m = k )
| ( n = m )
| ( n = k ) ),
inference(demodulation,[status(thm),theory(equality)],[c_251,c_250,c_295]) ).
tff(c_319,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_2,c_6,c_317]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN013-1 : TPTP v8.1.2. Released v1.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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 17:09:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.28/1.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.79
% 3.28/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.28/1.82
% 3.28/1.82 Inference rules
% 3.28/1.82 ----------------------
% 3.28/1.82 #Ref : 0
% 3.28/1.82 #Sup : 54
% 3.28/1.82 #Fact : 0
% 3.28/1.82 #Define : 0
% 3.28/1.82 #Split : 4
% 3.28/1.82 #Chain : 0
% 3.28/1.82 #Close : 0
% 3.28/1.82
% 3.28/1.82 Ordering : KBO
% 3.28/1.82
% 3.28/1.82 Simplification rules
% 3.28/1.82 ----------------------
% 3.28/1.82 #Subsume : 6
% 3.28/1.82 #Demod : 15
% 3.28/1.82 #Tautology : 20
% 3.28/1.82 #SimpNegUnit : 35
% 3.28/1.82 #BackRed : 4
% 3.28/1.82
% 3.28/1.82 #Partial instantiations: 0
% 3.28/1.82 #Strategies tried : 1
% 3.28/1.82
% 3.28/1.82 Timing (in seconds)
% 3.28/1.82 ----------------------
% 3.28/1.82 Preprocessing : 0.46
% 3.28/1.82 Parsing : 0.24
% 3.28/1.82 CNF conversion : 0.02
% 3.28/1.83 Main loop : 0.30
% 3.28/1.83 Inferencing : 0.11
% 3.28/1.83 Reduction : 0.08
% 3.28/1.83 Demodulation : 0.05
% 3.28/1.83 BG Simplification : 0.02
% 3.28/1.83 Subsumption : 0.07
% 3.28/1.83 Abstraction : 0.02
% 3.28/1.83 MUC search : 0.00
% 3.28/1.83 Cooper : 0.00
% 3.28/1.83 Total : 0.82
% 3.28/1.83 Index Insertion : 0.00
% 3.28/1.83 Index Deletion : 0.00
% 3.28/1.83 Index Matching : 0.00
% 3.28/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------