TSTP Solution File: KRS067+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS067+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:27 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 4 unt; 3 nHn; 17 RR)
% Number of literals : 35 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('KRS067+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ skP0(u)
| cc(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ skP0(u)
| cb(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ ca(u)
| ~ cc(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ ca(u)
| ~ cb(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cc(u)
| ~ cb(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| skP0(u)
| ca(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cUnsatisfiable(u)
| cc(u)
| cb(u)
| skP0(u) ),
file('KRS067+1.p',unknown),
[] ).
cnf(17,plain,
( ~ cUnsatisfiable(u)
| cb(u)
| cc(u) ),
inference(mrr,[status(thm)],[16,6]),
[iquote('0:MRR:16.3,6.0')] ).
cnf(29,plain,
( ~ skP0(u)
| ~ skP0(u) ),
inference(ems,[status(thm)],[11,6,7]),
[iquote('0:EmS:11.0,11.1,6.1,7.1')] ).
cnf(30,plain,
~ skP0(u),
inference(obv,[status(thm),theory(equality)],[29]),
[iquote('0:Obv:29.0')] ).
cnf(31,plain,
( ~ cUnsatisfiable(u)
| ca(u) ),
inference(mrr,[status(thm)],[12,30]),
[iquote('0:MRR:12.1,30.0')] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| cc(u) ),
inference(ems,[status(thm)],[10,31,17]),
[iquote('0:EmS:10.0,10.1,31.1,17.1')] ).
cnf(33,plain,
( ~ cUnsatisfiable(u)
| cc(u) ),
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.0')] ).
cnf(34,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[9,31,33]),
[iquote('0:EmS:9.0,9.1,31.1,33.1')] ).
cnf(35,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[34]),
[iquote('0:Obv:34.0')] ).
cnf(36,plain,
$false,
inference(unc,[status(thm)],[35,2]),
[iquote('0:UnC:35.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS067+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n021.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 : Tue Jun 7 18:47:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 17 clauses.
% 0.19/0.42 SPASS allocated 97582 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 2, length 17 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : axiom_5 axiom_2 axiom_3 axiom_4
% 0.19/0.42
%------------------------------------------------------------------------------