TSTP Solution File: SYN170-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN170-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:11 EDT 2022
% Result : Unsatisfiable 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 25 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p4(u,c,v),
file('SYN170-1.p',unknown),
[] ).
cnf(25,axiom,
l0(c),
file('SYN170-1.p',unknown),
[] ).
cnf(27,axiom,
n0(d,c),
file('SYN170-1.p',unknown),
[] ).
cnf(29,axiom,
k0(e),
file('SYN170-1.p',unknown),
[] ).
cnf(40,axiom,
( ~ n0(u,v)
| k1(v) ),
file('SYN170-1.p',unknown),
[] ).
cnf(118,axiom,
( ~ k1(u)
| ~ k0(e)
| ~ l0(c)
| p1(u,u,u) ),
file('SYN170-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN170-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN170-1.p',unknown),
[] ).
cnf(330,axiom,
( ~ p3(u,u,v)
| p4(v,v,v) ),
file('SYN170-1.p',unknown),
[] ).
cnf(399,plain,
( ~ k1(u)
| p1(u,u,u) ),
inference(mrr,[status(thm)],[118,29,25]),
[iquote('0:MRR:118.1,118.2,29.0,25.0')] ).
cnf(420,plain,
~ p3(u,u,c),
inference(res,[status(thm),theory(equality)],[330,1]),
[iquote('0:Res:330.1,1.0')] ).
cnf(469,plain,
k1(c),
inference(res,[status(thm),theory(equality)],[27,40]),
[iquote('0:Res:27.0,40.0')] ).
cnf(482,plain,
~ n2(c),
inference(res,[status(thm),theory(equality)],[283,420]),
[iquote('0:Res:283.1,420.0')] ).
cnf(506,plain,
( ~ k1(u)
| n2(u) ),
inference(res,[status(thm),theory(equality)],[399,176]),
[iquote('0:Res:399.1,176.0')] ).
cnf(511,plain,
~ k1(c),
inference(sor,[status(thm)],[482,506]),
[iquote('0:SoR:482.0,506.1')] ).
cnf(512,plain,
$false,
inference(ssi,[status(thm)],[511,25,469]),
[iquote('0:SSi:511.0,25.0,469.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN170-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n019.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:52:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.47
% 0.18/0.47 SPASS V 3.9
% 0.18/0.47 SPASS beiseite: Proof found.
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 SPASS derived 58 clauses, backtracked 0 clauses, performed 0 splits and kept 382 clauses.
% 0.18/0.47 SPASS allocated 76132 KBytes.
% 0.18/0.47 SPASS spent 0:00:00.12 on the problem.
% 0.18/0.47 0:00:00.04 for the input.
% 0.18/0.47 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.47 0:00:00.00 for inferences.
% 0.18/0.47 0:00:00.00 for the backtracking.
% 0.18/0.47 0:00:00.03 for the reduction.
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Here is a proof with depth 3, length 16 :
% 0.18/0.47 % SZS output start Refutation
% See solution above
% 0.18/0.47 Formulae used in the proof : prove_this axiom_24 axiom_26 axiom_28 rule_001 rule_079 rule_137 rule_244 rule_291
% 0.18/0.47
%------------------------------------------------------------------------------