TSTP Solution File: KRS012-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.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 : Sun Jul 17 03:30:16 EDT 2022
% Result : Unsatisfiable 0.21s 0.41s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 1 nHn; 12 RR)
% Number of literals : 22 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c(u)
| ~ d(v)
| ~ r(u,v)
| e(v) ),
file('KRS012-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ c(u)
| ~ r(u,v)
| d(v) ),
file('KRS012-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ e(u1r1(u))
| f(u) ),
file('KRS012-1.p',unknown),
[] ).
cnf(11,axiom,
( f(u)
| r(u,u1r1(u)) ),
file('KRS012-1.p',unknown),
[] ).
cnf(12,axiom,
c(exists__dfg),
file('KRS012-1.p',unknown),
[] ).
cnf(13,axiom,
~ f(exists__dfg),
file('KRS012-1.p',unknown),
[] ).
cnf(14,plain,
( ~ c(u)
| ~ r(u,v)
| e(v) ),
inference(mrr,[status(thm)],[1,2]),
[iquote('0:MRR:1.1,2.2')] ).
cnf(15,plain,
( ~ r(exists__dfg,u)
| e(u) ),
inference(res,[status(thm),theory(equality)],[12,14]),
[iquote('0:Res:12.0,14.0')] ).
cnf(17,plain,
~ e(u1r1(exists__dfg)),
inference(res,[status(thm),theory(equality)],[10,13]),
[iquote('0:Res:10.1,13.0')] ).
cnf(18,plain,
r(exists__dfg,u1r1(exists__dfg)),
inference(res,[status(thm),theory(equality)],[11,13]),
[iquote('0:Res:11.0,13.0')] ).
cnf(36,plain,
e(u1r1(exists__dfg)),
inference(res,[status(thm),theory(equality)],[18,15]),
[iquote('0:Res:18.0,15.0')] ).
cnf(37,plain,
$false,
inference(mrr,[status(thm)],[36,17]),
[iquote('0:MRR:36.0,17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 08:26:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.41
% 0.21/0.41 SPASS V 3.9
% 0.21/0.41 SPASS beiseite: Proof found.
% 0.21/0.41 % SZS status Theorem
% 0.21/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 19 clauses.
% 0.21/0.41 SPASS allocated 75592 KBytes.
% 0.21/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.21/0.41 0:00:00.03 for the input.
% 0.21/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.41 0:00:00.00 for inferences.
% 0.21/0.41 0:00:00.00 for the backtracking.
% 0.21/0.41 0:00:00.00 for the reduction.
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Here is a proof with depth 2, length 12 :
% 0.21/0.41 % SZS output start Refutation
% See solution above
% 0.21/0.41 Formulae used in the proof : clause_3 clause_4 clause_12 clause_13 clause_1 clause_2
% 0.21/0.41
%------------------------------------------------------------------------------