TSTP Solution File: SYN285-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN285-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:19:58 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of clauses : 37 ( 20 unt; 0 nHn; 37 RR)
% Number of literals : 61 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ q1(a,d,d),
file('SYN285-1.p',unknown),
[] ).
cnf(2,axiom,
s0(d),
file('SYN285-1.p',unknown),
[] ).
cnf(6,axiom,
s0(b),
file('SYN285-1.p',unknown),
[] ).
cnf(10,axiom,
r0(b),
file('SYN285-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN285-1.p',unknown),
[] ).
cnf(16,axiom,
n0(a,b),
file('SYN285-1.p',unknown),
[] ).
cnf(21,axiom,
l0(a),
file('SYN285-1.p',unknown),
[] ).
cnf(33,axiom,
k0(b),
file('SYN285-1.p',unknown),
[] ).
cnf(35,axiom,
n0(c,d),
file('SYN285-1.p',unknown),
[] ).
cnf(37,axiom,
q0(a,b),
file('SYN285-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN285-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN285-1.p',unknown),
[] ).
cnf(138,axiom,
( ~ l0(u)
| ~ k0(v)
| ~ q1(w,w,v)
| q1(u,w,w) ),
file('SYN285-1.p',unknown),
[] ).
cnf(144,axiom,
( ~ s0(u)
| ~ p0(v,d)
| q1(u,u,v) ),
file('SYN285-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN285-1.p',unknown),
[] ).
cnf(165,axiom,
( ~ s1(u)
| ~ q0(v,w)
| s1(v) ),
file('SYN285-1.p',unknown),
[] ).
cnf(175,axiom,
( ~ k1(b)
| m2(b) ),
file('SYN285-1.p',unknown),
[] ).
cnf(225,axiom,
( ~ l1(u,v)
| q2(v,v,u) ),
file('SYN285-1.p',unknown),
[] ).
cnf(228,axiom,
( ~ s1(b)
| ~ q2(b,u,b)
| s2(u) ),
file('SYN285-1.p',unknown),
[] ).
cnf(229,axiom,
( ~ s1(a)
| ~ s0(d)
| s2(d) ),
file('SYN285-1.p',unknown),
[] ).
cnf(375,plain,
( ~ s1(a)
| s2(d) ),
inference(mrr,[status(thm)],[229,2]),
[iquote('0:MRR:229.1,2.0')] ).
cnf(420,plain,
( ~ k0(u)
| ~ l0(a)
| ~ q1(d,d,u) ),
inference(res,[status(thm),theory(equality)],[138,1]),
[iquote('0:Res:138.3,1.0')] ).
cnf(421,plain,
( ~ k0(u)
| ~ q1(d,d,u) ),
inference(mrr,[status(thm)],[420,21]),
[iquote('0:MRR:420.1,21.0')] ).
cnf(456,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(457,plain,
( ~ q2(b,u,b)
| s2(u) ),
inference(mrr,[status(thm)],[228,456]),
[iquote('0:MRR:228.0,456.0')] ).
cnf(459,plain,
k1(d),
inference(res,[status(thm),theory(equality)],[35,40]),
[iquote('0:Res:35.0,40.0')] ).
cnf(462,plain,
k1(b),
inference(res,[status(thm),theory(equality)],[16,40]),
[iquote('0:Res:16.0,40.0')] ).
cnf(470,plain,
m2(b),
inference(mrr,[status(thm)],[175,462]),
[iquote('0:MRR:175.0,462.0')] ).
cnf(477,plain,
l1(b,b),
inference(res,[status(thm),theory(equality)],[16,41]),
[iquote('0:Res:16.0,41.0')] ).
cnf(509,plain,
q2(b,b,b),
inference(res,[status(thm),theory(equality)],[477,225]),
[iquote('0:Res:477.0,225.0')] ).
cnf(511,plain,
s2(b),
inference(res,[status(thm),theory(equality)],[509,457]),
[iquote('0:Res:509.0,457.0')] ).
cnf(610,plain,
( ~ q0(u,v)
| s1(u) ),
inference(ems,[status(thm)],[165,456]),
[iquote('0:EmS:165.0,456.0')] ).
cnf(611,plain,
s1(a),
inference(res,[status(thm),theory(equality)],[37,610]),
[iquote('0:Res:37.0,610.0')] ).
cnf(617,plain,
s2(d),
inference(mrr,[status(thm)],[375,611]),
[iquote('0:MRR:375.0,611.0')] ).
cnf(704,plain,
( ~ s0(u)
| q1(u,u,b) ),
inference(res,[status(thm),theory(equality)],[15,144]),
[iquote('0:Res:15.0,144.1')] ).
cnf(714,plain,
( ~ s0(d)
| ~ k0(b) ),
inference(res,[status(thm),theory(equality)],[704,421]),
[iquote('0:Res:704.1,421.1')] ).
cnf(715,plain,
$false,
inference(ssi,[status(thm)],[714,6,33,10,470,462,511,2,459,617]),
[iquote('0:SSi:714.1,714.0,6.0,33.0,10.0,470.0,462.0,511.0,2.0,459.0,617.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN285-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n007.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 16:36:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.47
% 0.19/0.47 SPASS V 3.9
% 0.19/0.47 SPASS beiseite: Proof found.
% 0.19/0.47 % SZS status Theorem
% 0.19/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 253 clauses, backtracked 0 clauses, performed 0 splits and kept 476 clauses.
% 0.19/0.47 SPASS allocated 76206 KBytes.
% 0.19/0.47 SPASS spent 0:00:00.12 on the problem.
% 0.19/0.47 0:00:00.04 for the input.
% 0.19/0.47 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.47 0:00:00.00 for inferences.
% 0.19/0.47 0:00:00.00 for the backtracking.
% 0.19/0.47 0:00:00.04 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 3, length 37 :
% 0.19/0.47 % SZS output start Refutation
% See solution above
% 0.19/0.47 Formulae used in the proof : prove_this axiom_1 axiom_5 axiom_9 axiom_14 axiom_15 axiom_20 axiom_32 axiom_34 axiom_36 rule_001 rule_002 rule_099 rule_105 rule_125 rule_126 rule_136 rule_186 rule_189 rule_190
% 0.19/0.47
%------------------------------------------------------------------------------