TSTP Solution File: SYN573-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %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 : 600s
% DateTime : Thu Jul 21 12:22:58 EDT 2022
% Result : Unsatisfiable 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 8 unt; 2 nHn; 17 RR)
% Number of literals : 32 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
p12(c15),
file('SYN573-1.p',unknown),
[] ).
cnf(3,axiom,
p2(u,u),
file('SYN573-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ p2(u,v)
| ~ p2(u,w)
| p2(w,v) ),
file('SYN573-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ p12(u)
| p11(u,c16)
| p2(u,f9(c17)) ),
file('SYN573-1.p',unknown),
[] ).
cnf(16,axiom,
p11(u,f3(f8(v),f3(f8(u),f5(f6(f7(c14)))))),
file('SYN573-1.p',unknown),
[] ).
cnf(17,axiom,
( ~ p11(u,v)
| ~ p2(v,w)
| ~ p2(u,x)
| p11(x,w) ),
file('SYN573-1.p',unknown),
[] ).
cnf(19,axiom,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
file('SYN573-1.p',unknown),
[] ).
cnf(21,axiom,
( ~ p11(u,v)
| p11(u,f3(f8(v),f3(f8(w),f5(f6(f7(c14)))))) ),
file('SYN573-1.p',unknown),
[] ).
cnf(51,plain,
( ~ p2(u,v)
| p2(v,u) ),
inference(res,[status(thm),theory(equality)],[3,13]),
[iquote('0:Res:3.0,13.0')] ).
cnf(164,plain,
( ~ p2(f3(f8(u),f3(f8(v),f5(f6(f7(c14))))),w)
| ~ p2(v,x)
| p11(x,w) ),
inference(res,[status(thm),theory(equality)],[16,17]),
[iquote('0:Res:16.0,17.0')] ).
cnf(198,plain,
~ p11(c15,c16),
inference(res,[status(thm),theory(equality)],[21,19]),
[iquote('0:Res:21.1,19.0')] ).
cnf(207,plain,
( ~ p12(u)
| p11(u,c16)
| p2(f9(c17),u) ),
inference(res,[status(thm),theory(equality)],[14,51]),
[iquote('0:Res:14.2,51.0')] ).
cnf(576,plain,
( ~ p2(u,v)
| p11(v,f3(f8(w),f3(f8(u),f5(f6(f7(c14)))))) ),
inference(res,[status(thm),theory(equality)],[3,164]),
[iquote('0:Res:3.0,164.0')] ).
cnf(1584,plain,
~ p2(f9(c17),c15),
inference(res,[status(thm),theory(equality)],[576,19]),
[iquote('0:Res:576.1,19.0')] ).
cnf(1587,plain,
( ~ p12(c15)
| p11(c15,c16) ),
inference(res,[status(thm),theory(equality)],[207,1584]),
[iquote('0:Res:207.2,1584.0')] ).
cnf(1588,plain,
p11(c15,c16),
inference(ssi,[status(thm)],[1587,1]),
[iquote('0:SSi:1587.0,1.0')] ).
cnf(1589,plain,
$false,
inference(mrr,[status(thm)],[1588,198]),
[iquote('0:MRR:1588.0,198.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 12 02:28:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.47/0.64
% 0.47/0.64 SPASS V 3.9
% 0.47/0.64 SPASS beiseite: Proof found.
% 0.47/0.64 % SZS status Theorem
% 0.47/0.64 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.64 SPASS derived 1457 clauses, backtracked 7 clauses, performed 2 splits and kept 697 clauses.
% 0.47/0.64 SPASS allocated 76802 KBytes.
% 0.47/0.64 SPASS spent 0:00:00.29 on the problem.
% 0.47/0.64 0:00:00.03 for the input.
% 0.47/0.64 0:00:00.00 for the FLOTTER CNF translation.
% 0.47/0.64 0:00:00.02 for inferences.
% 0.47/0.64 0:00:00.00 for the backtracking.
% 0.47/0.64 0:00:00.21 for the reduction.
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 Here is a proof with depth 4, length 17 :
% 0.47/0.64 % SZS output start Refutation
% See solution above
% 0.47/0.64 Formulae used in the proof : c15_is_p12_1 p2_3 p2_13 p11_14 p11_16 p11_17 not_p11_19 p11_21
% 0.47/0.64
%------------------------------------------------------------------------------