TSTP Solution File: SYN170-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN170-10 : TPTP v8.1.2. Released v7.5.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 : n007.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:09:49 EDT 2023
% Result : Unsatisfiable 12.41s 4.32s
% Output : CNFRefutation 12.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 62
% Syntax : Number of formulae : 78 ( 23 unt; 55 typ; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 94 ( 49 >; 45 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 55 ( 55 usr; 6 con; 0-4 aty)
% Number of variables : 36 (; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ ifeq > r3 > q2 > q1 > p5 > p4 > p3 > p2 > p1 > n1 > m3 > m1 > m0 > k3 > s3 > r5 > q5 > q4 > q3 > q0 > p0 > n5 > n4 > n0 > m5 > m4 > l3 > l2 > l1 > k2 > #nlpp > s5 > s4 > s2 > s1 > s0 > r4 > r2 > r1 > r0 > n3 > n2 > m2 > l5 > l4 > l0 > k5 > k4 > k1 > k0 > true > e > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(l2,type,
l2: ( $i * $i ) > $i ).
tff(s1,type,
s1: $i > $i ).
tff(k0,type,
k0: $i > $i ).
tff(s3,type,
s3: ( $i * $i ) > $i ).
tff(r0,type,
r0: $i > $i ).
tff(r4,type,
r4: $i > $i ).
tff(a,type,
a: $i ).
tff(k4,type,
k4: $i > $i ).
tff(p0,type,
p0: ( $i * $i ) > $i ).
tff(m2,type,
m2: $i > $i ).
tff(r5,type,
r5: ( $i * $i ) > $i ).
tff(r2,type,
r2: $i > $i ).
tff(r3,type,
r3: ( $i * $i * $i ) > $i ).
tff(n4,type,
n4: ( $i * $i ) > $i ).
tff(n2,type,
n2: $i > $i ).
tff(s2,type,
s2: $i > $i ).
tff(n3,type,
n3: $i > $i ).
tff(q2,type,
q2: ( $i * $i * $i ) > $i ).
tff(l1,type,
l1: ( $i * $i ) > $i ).
tff(r1,type,
r1: $i > $i ).
tff(q5,type,
q5: ( $i * $i ) > $i ).
tff(l4,type,
l4: $i > $i ).
tff(b,type,
b: $i ).
tff(q0,type,
q0: ( $i * $i ) > $i ).
tff(m1,type,
m1: ( $i * $i * $i ) > $i ).
tff(m5,type,
m5: ( $i * $i ) > $i ).
tff(l3,type,
l3: ( $i * $i ) > $i ).
tff(q4,type,
q4: ( $i * $i ) > $i ).
tff(l5,type,
l5: $i > $i ).
tff(q1,type,
q1: ( $i * $i * $i ) > $i ).
tff(m3,type,
m3: ( $i * $i * $i ) > $i ).
tff(n1,type,
n1: ( $i * $i * $i ) > $i ).
tff(p4,type,
p4: ( $i * $i * $i ) > $i ).
tff(p3,type,
p3: ( $i * $i * $i ) > $i ).
tff(k5,type,
k5: $i > $i ).
tff(p5,type,
p5: ( $i * $i * $i ) > $i ).
tff(p2,type,
p2: ( $i * $i * $i ) > $i ).
tff(k2,type,
k2: ( $i * $i ) > $i ).
tff(m0,type,
m0: ( $i * $i * $i ) > $i ).
tff(s4,type,
s4: $i > $i ).
tff(l0,type,
l0: $i > $i ).
tff(q3,type,
q3: ( $i * $i ) > $i ).
tff(s5,type,
s5: $i > $i ).
tff(d,type,
d: $i ).
tff(k1,type,
k1: $i > $i ).
tff(k3,type,
k3: ( $i * $i * $i ) > $i ).
tff(n5,type,
n5: ( $i * $i ) > $i ).
tff(true,type,
true: $i ).
tff(s0,type,
s0: $i > $i ).
tff(m4,type,
m4: ( $i * $i ) > $i ).
tff(e,type,
e: $i ).
tff(n0,type,
n0: ( $i * $i ) > $i ).
tff(p1,type,
p1: ( $i * $i * $i ) > $i ).
tff(ifeq,type,
ifeq: ( $i * $i * $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_24,axiom,
! [A,B,C] : ( ifeq(A,A,B,C) = B ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y] : ( m0(X,d,Y) = true ),
file(unknown,unknown) ).
tff(f_256,axiom,
! [A] : ( ifeq(m0(e,d,A),true,ifeq(m0(A,d,A),true,q1(e,A,A),true),true) = true ),
file(unknown,unknown) ).
tff(f_296,axiom,
! [A,J] : ( ifeq(q1(A,J,J),true,k2(J,J),true) = true ),
file(unknown,unknown) ).
tff(f_411,axiom,
! [G,F] : ( ifeq(k2(G,F),true,k3(F,F,G),true) = true ),
file(unknown,unknown) ).
tff(f_574,axiom,
! [B,C] : ( ifeq(k3(B,B,C),true,p4(B,C,B),true) = true ),
file(unknown,unknown) ).
tff(f_658,axiom,
! [X,Y] : ( p4(X,c,Y) != true ),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( ifeq(A_1,A_1,B_2,C_3) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_40,plain,
! [X_7,Y_8] : ( m0(X_7,d,Y_8) = true ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_288,plain,
! [A_205] : ( ifeq(m0(e,d,A_205),true,ifeq(m0(A_205,d,A_205),true,q1(e,A_205,A_205),true),true) = true ),
inference(cnfTransformation,[status(thm)],[f_256]) ).
tff(c_768,plain,
! [A_205] : ( ifeq(true,true,ifeq(true,true,q1(e,A_205,A_205),true),true) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_40,c_288]) ).
tff(c_817,plain,
! [A_205] : ( q1(e,A_205,A_205) = true ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_768]) ).
tff(c_3141,plain,
! [A_706,J_707] : ( ifeq(q1(A_706,J_707,J_707),true,k2(J_707,J_707),true) = true ),
inference(cnfTransformation,[status(thm)],[f_296]) ).
tff(c_3171,plain,
! [A_708] : ( ifeq(true,true,k2(A_708,A_708),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_817,c_3141]) ).
tff(c_3195,plain,
! [A_709] : ( k2(A_709,A_709) = true ),
inference(superposition,[status(thm),theory(equality)],[c_3171,c_2]) ).
tff(c_460,plain,
! [G_352,F_353] : ( ifeq(k2(G_352,F_353),true,k3(F_353,F_353,G_352),true) = true ),
inference(cnfTransformation,[status(thm)],[f_411]) ).
tff(c_5249,plain,
! [A_797] : ( ifeq(true,true,k3(A_797,A_797,A_797),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_3195,c_460]) ).
tff(c_5254,plain,
! [A_797] : ( k3(A_797,A_797,A_797) = true ),
inference(superposition,[status(thm),theory(equality)],[c_5249,c_2]) ).
tff(c_5469,plain,
! [B_805,C_806] : ( ifeq(k3(B_805,B_805,C_806),true,p4(B_805,C_806,B_805),true) = true ),
inference(cnfTransformation,[status(thm)],[f_574]) ).
tff(c_6626,plain,
! [A_880] : ( ifeq(true,true,p4(A_880,A_880,A_880),true) = true ),
inference(superposition,[status(thm),theory(equality)],[c_5254,c_5469]) ).
tff(c_6646,plain,
! [A_881] : ( p4(A_881,A_881,A_881) = true ),
inference(superposition,[status(thm),theory(equality)],[c_6626,c_2]) ).
tff(c_726,plain,
! [X_617,Y_618] : ( p4(X_617,c,Y_618) != true ),
inference(cnfTransformation,[status(thm)],[f_658]) ).
tff(c_6660,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_6646,c_726]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYN170-10 : TPTP v8.1.2. Released v7.5.0.
% 0.00/0.15 % 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.36 % Computer : n007.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 17:04:38 EDT 2023
% 0.16/0.36 % CPUTime :
% 12.41/4.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.41/4.33
% 12.41/4.33 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.41/4.36
% 12.41/4.36 Inference rules
% 12.41/4.36 ----------------------
% 12.41/4.36 #Ref : 0
% 12.41/4.36 #Sup : 1735
% 12.41/4.36 #Fact : 0
% 12.41/4.36 #Define : 0
% 12.41/4.36 #Split : 0
% 12.41/4.36 #Chain : 0
% 12.41/4.36 #Close : 0
% 12.41/4.36
% 12.41/4.36 Ordering : KBO
% 12.41/4.36
% 12.41/4.36 Simplification rules
% 12.41/4.36 ----------------------
% 12.41/4.36 #Subsume : 0
% 12.41/4.36 #Demod : 1328
% 12.41/4.36 #Tautology : 1695
% 12.41/4.36 #SimpNegUnit : 0
% 12.41/4.36 #BackRed : 144
% 12.41/4.36
% 12.41/4.36 #Partial instantiations: 0
% 12.41/4.36 #Strategies tried : 1
% 12.41/4.36
% 12.41/4.36 Timing (in seconds)
% 12.41/4.36 ----------------------
% 12.41/4.37 Preprocessing : 1.03
% 12.41/4.37 Parsing : 0.60
% 12.41/4.37 CNF conversion : 0.07
% 12.41/4.37 Main loop : 2.26
% 12.41/4.37 Inferencing : 0.52
% 12.41/4.37 Reduction : 1.15
% 12.41/4.37 Demodulation : 0.96
% 12.41/4.37 BG Simplification : 0.06
% 12.41/4.37 Subsumption : 0.36
% 12.41/4.37 Abstraction : 0.03
% 12.41/4.37 MUC search : 0.00
% 12.41/4.37 Cooper : 0.00
% 12.41/4.37 Total : 3.35
% 12.41/4.37 Index Insertion : 0.00
% 12.41/4.37 Index Deletion : 0.00
% 12.41/4.37 Index Matching : 0.00
% 12.41/4.37 BG Taut test : 0.00
%------------------------------------------------------------------------------