TSTP Solution File: KRS095+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS095+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:32 EDT 2022
% Result : Unsatisfiable 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 3 unt; 0 nHn; 11 RR)
% Number of literals : 25 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_20_14253),
file('KRS095+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf5(u)) ),
file('KRS095+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf4(u)) ),
file('KRS095+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cUnsatisfiable(u)
| ~ equal(skf5(u),skf4(u)) ),
file('KRS095+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(v,w) ),
file('KRS095+1.p',unknown),
[] ).
cnf(17,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(skf4(u),v) ),
inference(res,[status(thm),theory(equality)],[8,10]),
[iquote('0:Res:8.1,10.1')] ).
cnf(19,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(skf4(u),v) ),
inference(obv,[status(thm),theory(equality)],[17]),
[iquote('0:Obv:17.0')] ).
cnf(22,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf5(u),skf4(u)) ),
inference(res,[status(thm),theory(equality)],[7,19]),
[iquote('0:Res:7.1,19.1')] ).
cnf(23,plain,
( ~ cUnsatisfiable(u)
| equal(skf5(u),skf4(u)) ),
inference(obv,[status(thm),theory(equality)],[22]),
[iquote('0:Obv:22.0')] ).
cnf(24,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[23,9]),
[iquote('0:MRR:23.1,9.1')] ).
cnf(25,plain,
$false,
inference(unc,[status(thm)],[24,2]),
[iquote('0:UnC:24.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS095+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n024.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 06:16:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.18/0.45 SPASS allocated 97839 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.45 0:00:00.04 for the input.
% 0.18/0.45 0:00:00.05 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.00 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 2, length 11 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : axiom_4 axiom_2
% 0.18/0.45
%------------------------------------------------------------------------------