TSTP Solution File: SYN113-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN113-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:18:47 EDT 2022
% Result : Unsatisfiable 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of clauses : 38 ( 20 unt; 0 nHn; 38 RR)
% Number of literals : 63 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ k2(e,d),
file('SYN113-1.p',unknown),
[] ).
cnf(2,axiom,
s0(d),
file('SYN113-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN113-1.p',unknown),
[] ).
cnf(20,axiom,
m0(u,d,v),
file('SYN113-1.p',unknown),
[] ).
cnf(35,axiom,
n0(c,d),
file('SYN113-1.p',unknown),
[] ).
cnf(37,axiom,
q0(a,b),
file('SYN113-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(44,axiom,
( ~ m0(u,u,v)
| m1(v,u,v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(146,axiom,
( ~ m0(u,d,u)
| ~ m0(e,d,u)
| q1(e,u,u) ),
file('SYN113-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN113-1.p',unknown),
[] ).
cnf(165,axiom,
( ~ s1(u)
| ~ q0(v,w)
| s1(v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(166,axiom,
( ~ k1(u)
| ~ k2(u,v)
| ~ m1(w,v,x)
| k2(x,v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(168,axiom,
( ~ q1(u,v,v)
| k2(v,v) ),
file('SYN113-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN113-1.p',unknown),
[] ).
cnf(229,axiom,
( ~ s1(a)
| ~ s0(d)
| s2(d) ),
file('SYN113-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN113-1.p',unknown),
[] ).
cnf(338,axiom,
( ~ l1(u,v)
| ~ p3(w,v,x)
| s4(u) ),
file('SYN113-1.p',unknown),
[] ).
cnf(375,plain,
( ~ s1(a)
| s2(d) ),
inference(mrr,[status(thm)],[229,2]),
[iquote('0:MRR:229.1,2.0')] ).
cnf(403,plain,
q1(e,u,u),
inference(mrr,[status(thm)],[146,20]),
[iquote('0:MRR:146.0,146.1,20.0,20.0')] ).
cnf(419,plain,
( ~ k1(u)
| ~ k2(u,d)
| ~ m1(v,d,e) ),
inference(res,[status(thm),theory(equality)],[166,1]),
[iquote('0:Res:166.3,1.0')] ).
cnf(454,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(457,plain,
k1(d),
inference(res,[status(thm),theory(equality)],[35,40]),
[iquote('0:Res:35.0,40.0')] ).
cnf(472,plain,
l1(d,d),
inference(res,[status(thm),theory(equality)],[35,41]),
[iquote('0:Res:35.0,41.0')] ).
cnf(541,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(545,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[541,176]),
[iquote('0:Res:541.0,176.0')] ).
cnf(547,plain,
p3(u,u,u),
inference(mrr,[status(thm)],[283,545]),
[iquote('0:MRR:283.0,545.0')] ).
cnf(577,plain,
k2(u,u),
inference(res,[status(thm),theory(equality)],[403,168]),
[iquote('0:Res:403.0,168.0')] ).
cnf(602,plain,
( ~ q0(u,v)
| s1(u) ),
inference(ems,[status(thm)],[165,454]),
[iquote('0:EmS:165.0,454.0')] ).
cnf(603,plain,
s1(a),
inference(res,[status(thm),theory(equality)],[37,602]),
[iquote('0:Res:37.0,602.0')] ).
cnf(609,plain,
s2(d),
inference(mrr,[status(thm)],[375,603]),
[iquote('0:MRR:375.0,603.0')] ).
cnf(632,plain,
m1(u,d,u),
inference(res,[status(thm),theory(equality)],[20,44]),
[iquote('0:Res:20.0,44.0')] ).
cnf(733,plain,
( ~ l1(u,v)
| s4(u) ),
inference(res,[status(thm),theory(equality)],[547,338]),
[iquote('0:Res:547.0,338.1')] ).
cnf(738,plain,
s4(d),
inference(res,[status(thm),theory(equality)],[472,733]),
[iquote('0:Res:472.0,733.0')] ).
cnf(785,plain,
( ~ k1(u)
| ~ k2(u,d) ),
inference(res,[status(thm),theory(equality)],[632,419]),
[iquote('0:Res:632.0,419.2')] ).
cnf(787,plain,
~ k1(d),
inference(res,[status(thm),theory(equality)],[577,785]),
[iquote('0:Res:577.0,785.1')] ).
cnf(788,plain,
$false,
inference(ssi,[status(thm)],[787,2,457,609,738]),
[iquote('0:SSi:787.0,2.0,457.0,609.0,738.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN113-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 06:32:27 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.48
% 0.18/0.48 SPASS V 3.9
% 0.18/0.48 SPASS beiseite: Proof found.
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 SPASS derived 320 clauses, backtracked 0 clauses, performed 0 splits and kept 515 clauses.
% 0.18/0.48 SPASS allocated 76250 KBytes.
% 0.18/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.18/0.48 0:00:00.04 for the input.
% 0.18/0.48 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.48 0:00:00.00 for inferences.
% 0.18/0.48 0:00:00.00 for the backtracking.
% 0.18/0.48 0:00:00.04 for the reduction.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Here is a proof with depth 3, length 38 :
% 0.18/0.48 % SZS output start Refutation
% See solution above
% 0.18/0.48 Formulae used in the proof : prove_this axiom_1 axiom_14 axiom_19 axiom_34 axiom_36 rule_001 rule_002 rule_005 rule_085 rule_107 rule_125 rule_126 rule_127 rule_129 rule_137 rule_190 rule_244 rule_299
% 0.18/0.48
%------------------------------------------------------------------------------