TSTP Solution File: SYN653-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN653-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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 : 600s
% DateTime : Thu Jul 21 12:23:27 EDT 2022
% Result : Unsatisfiable 3.99s 4.18s
% Output : Refutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 6 unt; 0 nHn; 21 RR)
% Number of literals : 41 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 33 ( 33 usr; 25 con; 0-8 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
p7(u,u),
file('SYN653-1.p',unknown),
[] ).
cnf(9,axiom,
p12(u,u),
file('SYN653-1.p',unknown),
[] ).
cnf(10,axiom,
~ p12(f13(c22),f13(c23)),
file('SYN653-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ p7(u,v)
| p12(f13(u),f13(v)) ),
file('SYN653-1.p',unknown),
[] ).
cnf(19,axiom,
( ~ p7(u,v)
| ~ p7(u,w)
| p7(w,v) ),
file('SYN653-1.p',unknown),
[] ).
cnf(24,axiom,
( ~ p12(u,v)
| ~ p12(u,w)
| p12(w,v) ),
file('SYN653-1.p',unknown),
[] ).
cnf(27,axiom,
p21(f11(c24,c25,c22,c26,c27,c28),f11(c29,c30,c23,c31,c32,c33)),
file('SYN653-1.p',unknown),
[] ).
cnf(32,axiom,
( ~ p3(f11(u,v,w,x,y,z),f11(x1,x2,x3,x4,x5,x6))
| p7(w,x3) ),
file('SYN653-1.p',unknown),
[] ).
cnf(37,axiom,
( ~ p21(f11(u,v,w,x,y,z),x1)
| p12(f13(w),f13(f17(x2,u,v,z,x1,w,x,y))) ),
file('SYN653-1.p',unknown),
[] ).
cnf(48,axiom,
( ~ p21(f11(u,v,w,x,y,z),x1)
| p3(x1,f11(f19(x2,u,v,z,x1,w,x,y),f18(x2,u,v,z,x1,w,x,y),f17(x2,u,v,z,x1,w,x,y),f16(x2,u,v,z,x1,w,x,y),f15(x2,u,v,z,x1,w,x,y),f14(x2,u,v,z,x1,w,x,y))) ),
file('SYN653-1.p',unknown),
[] ).
cnf(54,plain,
( ~ p12(u,v)
| p12(v,u) ),
inference(res,[status(thm),theory(equality)],[9,24]),
[iquote('0:Res:9.0,24.0')] ).
cnf(55,plain,
( ~ p7(u,v)
| ~ p12(f13(u),w)
| p12(w,f13(v)) ),
inference(res,[status(thm),theory(equality)],[13,24]),
[iquote('0:Res:13.1,24.0')] ).
cnf(69,plain,
( ~ p7(u,v)
| p7(v,u) ),
inference(res,[status(thm),theory(equality)],[4,19]),
[iquote('0:Res:4.0,19.0')] ).
cnf(352,plain,
( ~ p21(f11(u,v,w,x,y,z),x1)
| p12(f13(f17(x2,u,v,z,x1,w,x,y)),f13(w)) ),
inference(res,[status(thm),theory(equality)],[37,54]),
[iquote('0:Res:37.1,54.0')] ).
cnf(887,plain,
( ~ p21(f11(u,v,w,x,y,z),f11(x1,x2,x3,x4,x5,x6))
| p7(x3,f17(x7,u,v,z,f11(x1,x2,x3,x4,x5,x6),w,x,y)) ),
inference(res,[status(thm),theory(equality)],[48,32]),
[iquote('0:Res:48.1,32.0')] ).
cnf(1407,plain,
( ~ p21(f11(u,v,w,x,y,z),f11(x1,x2,x3,x4,x5,x6))
| p7(f17(x7,u,v,z,f11(x1,x2,x3,x4,x5,x6),w,x,y),x3) ),
inference(res,[status(thm),theory(equality)],[887,69]),
[iquote('0:Res:887.1,69.0')] ).
cnf(2026,plain,
( ~ p21(f11(u,v,w,x,y,z),x1)
| ~ p7(f17(x2,u,v,z,x1,w,x,y),x3)
| p12(f13(w),f13(x3)) ),
inference(res,[status(thm),theory(equality)],[352,55]),
[iquote('0:Res:352.1,55.1')] ).
cnf(9634,plain,
( ~ p21(f11(u,v,w,x,y,z),f11(x1,x2,x3,x4,x5,x6))
| ~ p21(f11(u,v,w,x,y,z),f11(x1,x2,x3,x4,x5,x6))
| p12(f13(w),f13(x3)) ),
inference(res,[status(thm),theory(equality)],[1407,2026]),
[iquote('0:Res:1407.1,2026.1')] ).
cnf(9635,plain,
( ~ p21(f11(u,v,w,x,y,z),f11(x1,x2,x3,x4,x5,x6))
| p12(f13(w),f13(x3)) ),
inference(obv,[status(thm),theory(equality)],[9634]),
[iquote('0:Obv:9634.0')] ).
cnf(9637,plain,
p12(f13(c22),f13(c23)),
inference(res,[status(thm),theory(equality)],[27,9635]),
[iquote('0:Res:27.0,9635.0')] ).
cnf(9644,plain,
$false,
inference(mrr,[status(thm)],[9637,10]),
[iquote('0:MRR:9637.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN653-1 : TPTP v8.1.0. Released v2.5.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 22:56:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 3.99/4.18
% 3.99/4.18 SPASS V 3.9
% 3.99/4.18 SPASS beiseite: Proof found.
% 3.99/4.18 % SZS status Theorem
% 3.99/4.18 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.99/4.18 SPASS derived 9449 clauses, backtracked 0 clauses, performed 0 splits and kept 2273 clauses.
% 3.99/4.18 SPASS allocated 73428 KBytes.
% 3.99/4.18 SPASS spent 0:00:03.74 on the problem.
% 3.99/4.18 0:00:00.04 for the input.
% 3.99/4.18 0:00:00.00 for the FLOTTER CNF translation.
% 3.99/4.18 0:00:00.19 for inferences.
% 3.99/4.18 0:00:00.00 for the backtracking.
% 3.99/4.18 0:00:03.45 for the reduction.
% 3.99/4.18
% 3.99/4.18
% 3.99/4.18 Here is a proof with depth 5, length 21 :
% 3.99/4.18 % SZS output start Refutation
% See solution above
% 3.99/4.18 Formulae used in the proof : p7_4 p12_9 not_p12_10 p12_13 p7_19 p12_24 p21_27 p7_32 p12_37 p3_48
% 3.99/4.18
%------------------------------------------------------------------------------