TSTP Solution File: SYN009-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN009-2 : TPTP v8.1.0. Released v2.5.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:17:13 EDT 2022
% Result : Unsatisfiable 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 6 unt; 4 nHn; 13 RR)
% Number of literals : 28 ( 0 equ; 16 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ t(u,v,w)
| ~ p(u,v,w) ),
file('SYN009-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ t(u,v,w)
| ~ q(w,u,v) ),
file('SYN009-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ t(u,v,w)
| ~ r(v,w,u) ),
file('SYN009-2.p',unknown),
[] ).
cnf(6,axiom,
s(c),
file('SYN009-2.p',unknown),
[] ).
cnf(7,axiom,
t(c,c,c),
file('SYN009-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ s(u)
| ~ s(v)
| ~ s(w)
| r(u,w,v)
| q(v,u,w)
| p(w,v,u) ),
file('SYN009-2.p',unknown),
[] ).
cnf(12,plain,
~ r(c,c,c),
inference(res,[status(thm),theory(equality)],[7,3]),
[iquote('0:Res:7.0,3.0')] ).
cnf(13,plain,
~ q(c,c,c),
inference(res,[status(thm),theory(equality)],[7,2]),
[iquote('0:Res:7.0,2.0')] ).
cnf(14,plain,
~ p(c,c,c),
inference(res,[status(thm),theory(equality)],[7,1]),
[iquote('0:Res:7.0,1.0')] ).
cnf(15,plain,
( ~ s(c)
| ~ s(c)
| ~ s(c)
| r(c,c,c)
| q(c,c,c) ),
inference(res,[status(thm),theory(equality)],[8,14]),
[iquote('0:Res:8.5,14.0')] ).
cnf(16,plain,
( ~ s(c)
| r(c,c,c)
| q(c,c,c) ),
inference(obv,[status(thm),theory(equality)],[15]),
[iquote('0:Obv:15.1')] ).
cnf(17,plain,
( r(c,c,c)
| q(c,c,c) ),
inference(ssi,[status(thm)],[16,6]),
[iquote('0:SSi:16.0,6.0')] ).
cnf(18,plain,
$false,
inference(mrr,[status(thm)],[17,12,13]),
[iquote('0:MRR:17.0,17.1,12.0,13.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN009-2 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.15 % 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 22:57:45 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.43
% 0.21/0.43 SPASS V 3.9
% 0.21/0.43 SPASS beiseite: Proof found.
% 0.21/0.43 % SZS status Theorem
% 0.21/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.43 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.21/0.43 SPASS allocated 75589 KBytes.
% 0.21/0.43 SPASS spent 0:00:00.06 on the problem.
% 0.21/0.43 0:00:00.03 for the input.
% 0.21/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.43 0:00:00.00 for inferences.
% 0.21/0.43 0:00:00.00 for the backtracking.
% 0.21/0.43 0:00:00.00 for the reduction.
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 Here is a proof with depth 2, length 13 :
% 0.21/0.43 % SZS output start Refutation
% See solution above
% 0.21/0.43 Formulae used in the proof : clause_1 clause_2 clause_3 clause_6 clause_7 clause_8
% 0.21/0.43
%------------------------------------------------------------------------------