TSTP Solution File: SYN162-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN162-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:08 EDT 2022
% Result : Unsatisfiable 0.22s 0.52s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 11 unt; 0 nHn; 21 RR)
% Number of literals : 35 ( 0 equ; 18 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,
~ n5(c,c),
file('SYN162-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN162-1.p',unknown),
[] ).
cnf(18,axiom,
q0(u,d),
file('SYN162-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN162-1.p',unknown),
[] ).
cnf(164,axiom,
( ~ p0(u,u)
| s1(u) ),
file('SYN162-1.p',unknown),
[] ).
cnf(165,axiom,
( ~ s1(u)
| ~ q0(v,w)
| s1(v) ),
file('SYN162-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN162-1.p',unknown),
[] ).
cnf(249,axiom,
( ~ n2(u)
| k3(u,u,u) ),
file('SYN162-1.p',unknown),
[] ).
cnf(326,axiom,
( ~ k3(u,u,v)
| p4(u,v,u) ),
file('SYN162-1.p',unknown),
[] ).
cnf(355,axiom,
( ~ s1(u)
| ~ p4(v,u,u)
| ~ p4(b,b,w)
| n5(u,u) ),
file('SYN162-1.p',unknown),
[] ).
cnf(419,plain,
( ~ s1(c)
| ~ p4(u,c,c)
| ~ p4(b,b,v) ),
inference(res,[status(thm),theory(equality)],[355,1]),
[iquote('0:Res:355.3,1.0')] ).
cnf(462,plain,
s1(b),
inference(res,[status(thm),theory(equality)],[15,164]),
[iquote('0:Res:15.0,164.0')] ).
cnf(549,plain,
p1(u,u,u),
inference(res,[status(thm),theory(equality)],[15,124]),
[iquote('0:Res:15.0,124.0')] ).
cnf(554,plain,
n2(u),
inference(res,[status(thm),theory(equality)],[549,176]),
[iquote('0:Res:549.0,176.0')] ).
cnf(558,plain,
k3(u,u,u),
inference(mrr,[status(thm)],[249,554]),
[iquote('0:MRR:249.0,554.0')] ).
cnf(612,plain,
( ~ q0(u,v)
| s1(u) ),
inference(ems,[status(thm)],[165,462]),
[iquote('0:EmS:165.0,462.0')] ).
cnf(618,plain,
s1(u),
inference(res,[status(thm),theory(equality)],[18,612]),
[iquote('0:Res:18.0,612.0')] ).
cnf(629,plain,
( ~ p4(u,c,c)
| ~ p4(b,b,v) ),
inference(mrr,[status(thm)],[419,618]),
[iquote('0:MRR:419.0,618.0')] ).
cnf(641,plain,
p4(u,u,u),
inference(res,[status(thm),theory(equality)],[558,326]),
[iquote('0:Res:558.0,326.0')] ).
cnf(679,plain,
~ p4(b,b,u),
inference(res,[status(thm),theory(equality)],[641,629]),
[iquote('0:Res:641.0,629.0')] ).
cnf(680,plain,
$false,
inference(unc,[status(thm)],[679,641]),
[iquote('0:UnC:679.0,641.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYN162-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 18:38:30 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.52
% 0.22/0.52 SPASS V 3.9
% 0.22/0.52 SPASS beiseite: Proof found.
% 0.22/0.52 % SZS status Theorem
% 0.22/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.52 SPASS derived 225 clauses, backtracked 0 clauses, performed 0 splits and kept 460 clauses.
% 0.22/0.52 SPASS allocated 76191 KBytes.
% 0.22/0.52 SPASS spent 0:00:00.14 on the problem.
% 0.22/0.52 0:00:00.06 for the input.
% 0.22/0.52 0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.52 0:00:00.00 for inferences.
% 0.22/0.52 0:00:00.00 for the backtracking.
% 0.22/0.52 0:00:00.03 for the reduction.
% 0.22/0.52
% 0.22/0.52
% 0.22/0.52 Here is a proof with depth 3, length 21 :
% 0.22/0.52 % SZS output start Refutation
% See solution above
% 0.22/0.52 Formulae used in the proof : prove_this axiom_14 axiom_17 rule_085 rule_125 rule_126 rule_137 rule_210 rule_287 rule_316
% 0.22/0.52
%------------------------------------------------------------------------------