TSTP Solution File: SYN313-1.001.002 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN313-1.001.002 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:20:10 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 17 ( 4 unt; 9 nHn; 17 RR)
% Number of literals : 48 ( 0 equ; 12 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(u,f1(v),w)
| ~ p(u,f0(u),v) ),
file('SYN313-1.001.002.p',unknown),
[] ).
cnf(2,axiom,
( p(h0,u,j0(v))
| p(h2(w),v,j2(v))
| p(h1(u),w,j1(v)) ),
file('SYN313-1.001.002.p',unknown),
[] ).
cnf(4,plain,
( ~ p(h1(u),f0(h1(u)),v)
| p(h0,u,j0(w))
| p(h2(f1(v)),w,j2(w)) ),
inference(res,[status(thm),theory(equality)],[2,1]),
[iquote('0:Res:2.2,1.0')] ).
cnf(5,plain,
( p(h0,u,j0(v))
| p(h2(f0(h1(u))),v,j2(v))
| p(h0,u,j0(w))
| p(h2(f1(j1(v))),w,j2(w)) ),
inference(res,[status(thm),theory(equality)],[2,4]),
[iquote('0:Res:2.2,4.0')] ).
cnf(10,plain,
( ~ p(h2(f1(j1(u))),f0(h2(f1(j1(u)))),v)
| p(h0,w,j0(u))
| p(h2(f0(h1(w))),u,j2(u))
| p(h0,w,j0(f1(v))) ),
inference(res,[status(thm),theory(equality)],[5,1]),
[iquote('0:Res:5.3,1.0')] ).
cnf(14,plain,
( p(h0,u,j0(v))
| p(h2(f0(h1(u))),v,j2(v))
| p(h0,u,j0(f0(h2(f1(j1(v))))))
| p(h0,w,j0(v))
| p(h2(f0(h1(w))),v,j2(v))
| p(h0,w,j0(f1(j2(f0(h2(f1(j1(v)))))))) ),
inference(res,[status(thm),theory(equality)],[5,10]),
[iquote('0:Res:5.3,10.0')] ).
cnf(45,plain,
( p(h0,u,j0(v))
| p(h0,u,j0(f0(h2(f1(j1(v))))))
| p(h0,u,j0(v))
| p(h2(f0(h1(u))),v,j2(v))
| p(h0,u,j0(f1(j2(f0(h2(f1(j1(v)))))))) ),
inference(fac,[status(thm)],[14]),
[iquote('0:Fac:14.1,14.4')] ).
cnf(57,plain,
( p(h0,u,j0(f0(h2(f1(j1(v))))))
| p(h0,u,j0(v))
| p(h2(f0(h1(u))),v,j2(v))
| p(h0,u,j0(f1(j2(f0(h2(f1(j1(v)))))))) ),
inference(obv,[status(thm),theory(equality)],[45]),
[iquote('0:Obv:45.0')] ).
cnf(63,plain,
( ~ p(h0,f0(h0),u)
| p(h0,f1(u),j0(f0(h2(f1(j1(v))))))
| p(h0,f1(u),j0(v))
| p(h2(f0(h1(f1(u)))),v,j2(v)) ),
inference(res,[status(thm),theory(equality)],[57,1]),
[iquote('0:Res:57.3,1.0')] ).
cnf(67,plain,
( ~ p(h0,f0(h0),u)
| p(h2(f0(h1(f1(u)))),v,j2(v)) ),
inference(mrr,[status(thm)],[63,1]),
[iquote('0:MRR:63.1,63.2,1.0,1.0')] ).
cnf(76,plain,
( ~ p(h0,f0(h0),u)
| ~ p(h2(f0(h1(f1(u)))),f0(h2(f0(h1(f1(u))))),v) ),
inference(res,[status(thm),theory(equality)],[67,1]),
[iquote('0:Res:67.1,1.0')] ).
cnf(87,plain,
( ~ p(h0,f0(h0),u)
| ~ p(h0,f0(h0),u) ),
inference(res,[status(thm),theory(equality)],[67,76]),
[iquote('0:Res:67.1,76.1')] ).
cnf(88,plain,
~ p(h0,f0(h0),u),
inference(obv,[status(thm),theory(equality)],[87]),
[iquote('0:Obv:87.0')] ).
cnf(95,plain,
( p(h0,f0(h0),j0(f0(h2(f1(j1(u))))))
| p(h0,f0(h0),j0(u))
| p(h2(f0(h1(f0(h0)))),u,j2(u)) ),
inference(res,[status(thm),theory(equality)],[57,88]),
[iquote('0:Res:57.3,88.0')] ).
cnf(97,plain,
p(h2(f0(h1(f0(h0)))),u,j2(u)),
inference(mrr,[status(thm)],[95,88]),
[iquote('0:MRR:95.0,95.1,88.0,88.0')] ).
cnf(98,plain,
~ p(h2(f0(h1(f0(h0)))),f0(h2(f0(h1(f0(h0))))),u),
inference(res,[status(thm),theory(equality)],[97,1]),
[iquote('0:Res:97.0,1.0')] ).
cnf(101,plain,
$false,
inference(unc,[status(thm)],[98,97]),
[iquote('0:UnC:98.0,97.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN313-1.001.002 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n022.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 05:21:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.40
% 0.18/0.40 SPASS V 3.9
% 0.18/0.40 SPASS beiseite: Proof found.
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 SPASS derived 88 clauses, backtracked 0 clauses, performed 0 splits and kept 66 clauses.
% 0.18/0.40 SPASS allocated 63355 KBytes.
% 0.18/0.40 SPASS spent 0:00:00.05 on the problem.
% 0.18/0.40 0:00:00.02 for the input.
% 0.18/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40 0:00:00.00 for inferences.
% 0.18/0.40 0:00:00.00 for the backtracking.
% 0.18/0.40 0:00:00.01 for the reduction.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Here is a proof with depth 10, length 17 :
% 0.18/0.40 % SZS output start Refutation
% See solution above
% 0.18/0.41 Formulae used in the proof : clause1 clause2
% 0.18/0.41
%------------------------------------------------------------------------------