TSTP Solution File: SYN005-1.010 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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:17:08 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 12 unt; 0 nHn; 21 RR)
% Number of literals : 66 ( 0 equ; 55 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p_10(u,v)
| ~ p_9(w,u)
| ~ p_8(x,w)
| ~ p_7(y,x)
| ~ p_6(z,y)
| ~ p_5(x1,z)
| ~ p_4(x2,x1)
| ~ p_3(x3,x2)
| ~ p_2(x4,x3)
| ~ p_1(v,x4) ),
file('SYN005-1.010.p',unknown),
[] ).
cnf(2,axiom,
p_1(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(3,axiom,
p_2(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(4,axiom,
p_3(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(5,axiom,
p_4(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(6,axiom,
p_5(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(7,axiom,
p_6(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(8,axiom,
p_7(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(9,axiom,
p_8(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(10,axiom,
p_9(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(11,axiom,
p_10(a,a),
file('SYN005-1.010.p',unknown),
[] ).
cnf(12,plain,
( ~ p_9(u,a)
| ~ p_8(v,u)
| ~ p_7(w,v)
| ~ p_6(x,w)
| ~ p_5(y,x)
| ~ p_4(z,y)
| ~ p_3(x1,z)
| ~ p_2(x2,x1)
| ~ p_1(a,x2) ),
inference(res,[status(thm),theory(equality)],[11,1]),
[iquote('0:Res:11.0,1.0')] ).
cnf(13,plain,
( ~ p_8(u,a)
| ~ p_7(v,u)
| ~ p_6(w,v)
| ~ p_5(x,w)
| ~ p_4(y,x)
| ~ p_3(z,y)
| ~ p_2(x1,z)
| ~ p_1(a,x1) ),
inference(res,[status(thm),theory(equality)],[10,12]),
[iquote('0:Res:10.0,12.0')] ).
cnf(14,plain,
( ~ p_7(u,a)
| ~ p_6(v,u)
| ~ p_5(w,v)
| ~ p_4(x,w)
| ~ p_3(y,x)
| ~ p_2(z,y)
| ~ p_1(a,z) ),
inference(res,[status(thm),theory(equality)],[9,13]),
[iquote('0:Res:9.0,13.0')] ).
cnf(15,plain,
( ~ p_6(u,a)
| ~ p_5(v,u)
| ~ p_4(w,v)
| ~ p_3(x,w)
| ~ p_2(y,x)
| ~ p_1(a,y) ),
inference(res,[status(thm),theory(equality)],[8,14]),
[iquote('0:Res:8.0,14.0')] ).
cnf(16,plain,
( ~ p_5(u,a)
| ~ p_4(v,u)
| ~ p_3(w,v)
| ~ p_2(x,w)
| ~ p_1(a,x) ),
inference(res,[status(thm),theory(equality)],[7,15]),
[iquote('0:Res:7.0,15.0')] ).
cnf(17,plain,
( ~ p_4(u,a)
| ~ p_3(v,u)
| ~ p_2(w,v)
| ~ p_1(a,w) ),
inference(res,[status(thm),theory(equality)],[6,16]),
[iquote('0:Res:6.0,16.0')] ).
cnf(18,plain,
( ~ p_3(u,a)
| ~ p_2(v,u)
| ~ p_1(a,v) ),
inference(res,[status(thm),theory(equality)],[5,17]),
[iquote('0:Res:5.0,17.0')] ).
cnf(19,plain,
( ~ p_2(u,a)
| ~ p_1(a,u) ),
inference(res,[status(thm),theory(equality)],[4,18]),
[iquote('0:Res:4.0,18.0')] ).
cnf(20,plain,
~ p_1(a,a),
inference(res,[status(thm),theory(equality)],[3,19]),
[iquote('0:Res:3.0,19.0')] ).
cnf(21,plain,
$false,
inference(mrr,[status(thm)],[20,2]),
[iquote('0:MRR:20.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN005-1.010 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 04:39:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 20 clauses.
% 0.20/0.41 SPASS allocated 63105 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.41 0:00:00.03 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 9, length 21 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : disjunction p_1 p_2 p_3 p_4 p_5 p_6 p_7 p_8 p_9 p_10
% 0.20/0.41
%------------------------------------------------------------------------------