TSTP Solution File: SYN211-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN211-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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:28 EDT 2022
% Result : Unsatisfiable 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 22 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 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,
~ s4(d),
file('SYN211-1.p',unknown),
[] ).
cnf(15,axiom,
p0(b,u),
file('SYN211-1.p',unknown),
[] ).
cnf(35,axiom,
n0(c,d),
file('SYN211-1.p',unknown),
[] ).
cnf(41,axiom,
( ~ n0(u,v)
| l1(v,v) ),
file('SYN211-1.p',unknown),
[] ).
cnf(124,axiom,
( ~ p0(u,v)
| p1(v,v,v) ),
file('SYN211-1.p',unknown),
[] ).
cnf(176,axiom,
( ~ p1(u,v,w)
| n2(w) ),
file('SYN211-1.p',unknown),
[] ).
cnf(283,axiom,
( ~ n2(u)
| p3(u,u,u) ),
file('SYN211-1.p',unknown),
[] ).
cnf(338,axiom,
( ~ l1(u,v)
| ~ p3(w,v,x)
| s4(u) ),
file('SYN211-1.p',unknown),
[] ).
cnf(419,plain,
( ~ l1(d,u)
| ~ p3(v,u,w) ),
inference(res,[status(thm),theory(equality)],[338,1]),
[iquote('0:Res:338.2,1.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(621,plain,
~ l1(d,u),
inference(res,[status(thm),theory(equality)],[547,419]),
[iquote('0:Res:547.0,419.1')] ).
cnf(622,plain,
$false,
inference(unc,[status(thm)],[621,472]),
[iquote('0:UnC:621.0,472.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN211-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n025.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 03:59:33 EDT 2022
% 0.13/0.34 % 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/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 168 clauses, backtracked 0 clauses, performed 0 splits and kept 436 clauses.
% 0.19/0.47 SPASS allocated 76169 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.03 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 2, length 15 :
% 0.19/0.47 % SZS output start Refutation
% See solution above
% 0.19/0.47 Formulae used in the proof : prove_this axiom_14 axiom_34 rule_002 rule_085 rule_137 rule_244 rule_299
% 0.19/0.47
%------------------------------------------------------------------------------