TSTP Solution File: SYN182-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SYN182-1 : TPTP v8.1.2. Released v1.1.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 : n023.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:51 EDT 2023
% Result : Unsatisfiable 8.02s 2.81s
% Output : CNFRefutation 8.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 63
% Syntax : Number of formulae : 82 ( 12 unt; 53 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 26 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 90 ( 48 >; 42 *; 0 +; 0 <<)
% Number of predicates : 49 ( 48 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 (; 29 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ 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 > s5 > s4 > s2 > s1 > s0 > r4 > r2 > r1 > r0 > n3 > n2 > m2 > l5 > l4 > l0 > k5 > k4 > k1 > k0 > #nlpp > e > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(n5,type,
n5: ( $i * $i ) > $o ).
tff(p2,type,
p2: ( $i * $i * $i ) > $o ).
tff(m2,type,
m2: $i > $o ).
tff(s5,type,
s5: $i > $o ).
tff(s1,type,
s1: $i > $o ).
tff(m5,type,
m5: ( $i * $i ) > $o ).
tff(q4,type,
q4: ( $i * $i ) > $o ).
tff(m4,type,
m4: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(k1,type,
k1: $i > $o ).
tff(l1,type,
l1: ( $i * $i ) > $o ).
tff(s0,type,
s0: $i > $o ).
tff(q2,type,
q2: ( $i * $i * $i ) > $o ).
tff(n0,type,
n0: ( $i * $i ) > $o ).
tff(k0,type,
k0: $i > $o ).
tff(m3,type,
m3: ( $i * $i * $i ) > $o ).
tff(r4,type,
r4: $i > $o ).
tff(l0,type,
l0: $i > $o ).
tff(q0,type,
q0: ( $i * $i ) > $o ).
tff(k4,type,
k4: $i > $o ).
tff(m1,type,
m1: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(p0,type,
p0: ( $i * $i ) > $o ).
tff(r0,type,
r0: $i > $o ).
tff(q1,type,
q1: ( $i * $i * $i ) > $o ).
tff(s4,type,
s4: $i > $o ).
tff(r3,type,
r3: ( $i * $i * $i ) > $o ).
tff(k2,type,
k2: ( $i * $i ) > $o ).
tff(n2,type,
n2: $i > $o ).
tff(s3,type,
s3: ( $i * $i ) > $o ).
tff(l3,type,
l3: ( $i * $i ) > $o ).
tff(p3,type,
p3: ( $i * $i * $i ) > $o ).
tff(p4,type,
p4: ( $i * $i * $i ) > $o ).
tff(s2,type,
s2: $i > $o ).
tff(r5,type,
r5: ( $i * $i ) > $o ).
tff(k3,type,
k3: ( $i * $i * $i ) > $o ).
tff(d,type,
d: $i ).
tff(l2,type,
l2: ( $i * $i ) > $o ).
tff(l4,type,
l4: $i > $o ).
tff(l5,type,
l5: $i > $o ).
tff(k5,type,
k5: $i > $o ).
tff(p5,type,
p5: ( $i * $i * $i ) > $o ).
tff(n4,type,
n4: ( $i * $i ) > $o ).
tff(q3,type,
q3: ( $i * $i ) > $o ).
tff(m0,type,
m0: ( $i * $i * $i ) > $o ).
tff(q5,type,
q5: ( $i * $i ) > $o ).
tff(e,type,
e: $i ).
tff(n1,type,
n1: ( $i * $i * $i ) > $o ).
tff(r1,type,
r1: $i > $o ).
tff(n3,type,
n3: $i > $o ).
tff(r2,type,
r2: $i > $o ).
tff(p1,type,
p1: ( $i * $i * $i ) > $o ).
tff(c,type,
c: $i ).
tff(f_73,axiom,
n0(d,c),
file(unknown,unknown) ).
tff(f_91,axiom,
! [I,J] :
( k1(I)
| ~ n0(J,I) ),
file(unknown,unknown) ).
tff(f_71,axiom,
l0(c),
file(unknown,unknown) ).
tff(f_75,axiom,
k0(e),
file(unknown,unknown) ).
tff(f_710,axiom,
! [A] :
( p1(A,A,A)
| ~ k0(e)
| ~ k1(A)
| ~ l0(c) ),
file(unknown,unknown) ).
tff(f_1169,axiom,
! [A,B,C] :
( n2(A)
| ~ p1(B,C,A) ),
file(unknown,unknown) ).
tff(f_2042,axiom,
! [H] :
( p3(H,H,H)
| ~ n2(H) ),
file(unknown,unknown) ).
tff(f_2334,axiom,
! [J,A,B] :
( l4(J)
| ~ p3(A,B,J) ),
file(unknown,unknown) ).
tff(f_2712,axiom,
! [I] :
( q5(I,I)
| ~ l4(I) ),
file(unknown,unknown) ).
tff(f_2765,axiom,
! [X] : ~ q5(X,c),
file(unknown,unknown) ).
tff(c_52,plain,
n0(d,c),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_915,plain,
! [J_650,I_651] :
( ~ n0(J_650,I_651)
| k1(I_651) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_943,plain,
k1(c),
inference(resolution,[status(thm)],[c_52,c_915]) ).
tff(c_48,plain,
l0(c),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_56,plain,
k0(e),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_234,plain,
! [A_144] :
( ~ l0(c)
| ~ k1(A_144)
| ~ k0(e)
| p1(A_144,A_144,A_144) ),
inference(cnfTransformation,[status(thm)],[f_710]) ).
tff(c_750,plain,
! [A_144] :
( ~ l0(c)
| ~ k1(A_144)
| p1(A_144,A_144,A_144) ),
inference(demodulation,[status(thm),theory(equality)],[c_56,c_234]) ).
tff(c_981,plain,
! [A_674] :
( ~ k1(A_674)
| p1(A_674,A_674,A_674) ),
inference(demodulation,[status(thm),theory(equality)],[c_48,c_750]) ).
tff(c_350,plain,
! [B_257,C_258,A_256] :
( ~ p1(B_257,C_258,A_256)
| n2(A_256) ),
inference(cnfTransformation,[status(thm)],[f_1169]) ).
tff(c_985,plain,
! [A_674] :
( n2(A_674)
| ~ k1(A_674) ),
inference(resolution,[status(thm)],[c_981,c_350]) ).
tff(c_564,plain,
! [H_442] :
( ~ n2(H_442)
| p3(H_442,H_442,H_442) ),
inference(cnfTransformation,[status(thm)],[f_2042]) ).
tff(c_1037,plain,
! [A_685,B_686,J_687] :
( ~ p3(A_685,B_686,J_687)
| l4(J_687) ),
inference(cnfTransformation,[status(thm)],[f_2334]) ).
tff(c_1042,plain,
! [H_688] :
( l4(H_688)
| ~ n2(H_688) ),
inference(resolution,[status(thm)],[c_564,c_1037]) ).
tff(c_1060,plain,
! [A_690] :
( l4(A_690)
| ~ k1(A_690) ),
inference(resolution,[status(thm)],[c_985,c_1042]) ).
tff(c_907,plain,
! [I_648] :
( ~ l4(I_648)
| q5(I_648,I_648) ),
inference(cnfTransformation,[status(thm)],[f_2712]) ).
tff(c_738,plain,
! [X_627] : ~ q5(X_627,c),
inference(cnfTransformation,[status(thm)],[f_2765]) ).
tff(c_912,plain,
~ l4(c),
inference(resolution,[status(thm)],[c_907,c_738]) ).
tff(c_1063,plain,
~ k1(c),
inference(resolution,[status(thm)],[c_1060,c_912]) ).
tff(c_1067,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_943,c_1063]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN182-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/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.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:24:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.02/2.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.02/2.82
% 8.02/2.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.22/2.85
% 8.22/2.85 Inference rules
% 8.22/2.85 ----------------------
% 8.22/2.85 #Ref : 0
% 8.22/2.85 #Sup : 40
% 8.22/2.85 #Fact : 0
% 8.22/2.85 #Define : 0
% 8.22/2.85 #Split : 12
% 8.22/2.85 #Chain : 0
% 8.22/2.85 #Close : 0
% 8.22/2.85
% 8.22/2.85 Ordering : KBO
% 8.22/2.85
% 8.22/2.85 Simplification rules
% 8.22/2.85 ----------------------
% 8.22/2.85 #Subsume : 31
% 8.22/2.85 #Demod : 64
% 8.22/2.85 #Tautology : 21
% 8.22/2.85 #SimpNegUnit : 1
% 8.22/2.85 #BackRed : 0
% 8.22/2.85
% 8.22/2.85 #Partial instantiations: 0
% 8.22/2.85 #Strategies tried : 1
% 8.22/2.85
% 8.22/2.85 Timing (in seconds)
% 8.22/2.85 ----------------------
% 8.22/2.85 Preprocessing : 0.99
% 8.22/2.85 Parsing : 0.57
% 8.22/2.85 CNF conversion : 0.08
% 8.22/2.85 Main loop : 0.80
% 8.22/2.85 Inferencing : 0.17
% 8.22/2.85 Reduction : 0.31
% 8.22/2.85 Demodulation : 0.21
% 8.22/2.85 BG Simplification : 0.09
% 8.22/2.85 Subsumption : 0.19
% 8.22/2.85 Abstraction : 0.02
% 8.22/2.85 MUC search : 0.00
% 8.22/2.85 Cooper : 0.00
% 8.22/2.85 Total : 1.84
% 8.22/2.85 Index Insertion : 0.00
% 8.22/2.85 Index Deletion : 0.00
% 8.22/2.85 Index Matching : 0.00
% 8.22/2.85 BG Taut test : 0.00
%------------------------------------------------------------------------------