TSTP Solution File: KRS071+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS071+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 24 ( 6 unt; 10 nHn; 24 RR)
% Number of literals : 72 ( 0 equ; 34 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_18_39380),
file('KRS071+1.p',unknown),
[] ).
cnf(4,axiom,
cp3(skf8(u)),
file('KRS071+1.p',unknown),
[] ).
cnf(5,axiom,
cp2(skf7(u)),
file('KRS071+1.p',unknown),
[] ).
cnf(6,axiom,
cp1(skf6(u)),
file('KRS071+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cp1(u)
| ~ cp2(u) ),
file('KRS071+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cp1(u)
| ~ cp3(u) ),
file('KRS071+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cp2(u)
| ~ cp3(u) ),
file('KRS071+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf6(u)) ),
file('KRS071+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf7(u)) ),
file('KRS071+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf8(u)) ),
file('KRS071+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| ~ rr(u,x)
| equal(x,w)
| equal(v,w)
| equal(v,x) ),
file('KRS071+1.p',unknown),
[] ).
cnf(37,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(w,v)
| equal(skf6(u),v)
| equal(skf6(u),w) ),
inference(res,[status(thm),theory(equality)],[19,24]),
[iquote('0:Res:19.1,24.1')] ).
cnf(39,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(w,v)
| equal(skf6(u),v)
| equal(skf6(u),w) ),
inference(obv,[status(thm),theory(equality)],[37]),
[iquote('0:Obv:37.0')] ).
cnf(43,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(v,skf7(u))
| equal(skf7(u),skf6(u))
| equal(skf6(u),v) ),
inference(res,[status(thm),theory(equality)],[20,39]),
[iquote('0:Res:20.1,39.1')] ).
cnf(46,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(v,skf7(u))
| equal(skf7(u),skf6(u))
| equal(skf6(u),v) ),
inference(obv,[status(thm),theory(equality)],[43]),
[iquote('0:Obv:43.0')] ).
cnf(48,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf8(u),skf7(u))
| equal(skf7(u),skf6(u))
| equal(skf8(u),skf6(u)) ),
inference(res,[status(thm),theory(equality)],[21,46]),
[iquote('0:Res:21.1,46.1')] ).
cnf(52,plain,
( ~ cUnsatisfiable(u)
| equal(skf8(u),skf7(u))
| equal(skf7(u),skf6(u))
| equal(skf8(u),skf6(u)) ),
inference(obv,[status(thm),theory(equality)],[48]),
[iquote('0:Obv:48.0')] ).
cnf(58,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u))
| equal(skf8(u),skf6(u))
| cp3(skf7(u)) ),
inference(spr,[status(thm),theory(equality)],[52,4]),
[iquote('0:SpR:52.1,4.0')] ).
cnf(64,plain,
( ~ cUnsatisfiable(u)
| equal(skf8(u),skf6(u))
| equal(skf7(u),skf6(u)) ),
inference(ems,[status(thm)],[14,5,58]),
[iquote('0:EmS:14.0,14.1,5.0,58.3')] ).
cnf(65,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u))
| cp3(skf6(u)) ),
inference(spr,[status(thm),theory(equality)],[64,4]),
[iquote('0:SpR:64.1,4.0')] ).
cnf(71,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf6(u)) ),
inference(ems,[status(thm)],[11,6,65]),
[iquote('0:EmS:11.0,11.1,6.0,65.2')] ).
cnf(79,plain,
( ~ cUnsatisfiable(u)
| cp2(skf6(u)) ),
inference(spr,[status(thm),theory(equality)],[71,5]),
[iquote('0:SpR:71.1,5.0')] ).
cnf(81,plain,
~ cUnsatisfiable(u),
inference(ems,[status(thm)],[10,6,79]),
[iquote('0:EmS:10.0,10.1,6.0,79.1')] ).
cnf(82,plain,
$false,
inference(unc,[status(thm)],[81,2]),
[iquote('0:UnC:81.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS071+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n020.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 12:41:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.49
% 0.19/0.49 SPASS V 3.9
% 0.19/0.49 SPASS beiseite: Proof found.
% 0.19/0.49 % SZS status Theorem
% 0.19/0.49 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 SPASS derived 40 clauses, backtracked 0 clauses, performed 0 splits and kept 50 clauses.
% 0.19/0.49 SPASS allocated 98350 KBytes.
% 0.19/0.49 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.49 0:00:00.04 for the input.
% 0.19/0.49 0:00:00.06 for the FLOTTER CNF translation.
% 0.19/0.49 0:00:00.00 for inferences.
% 0.19/0.49 0:00:00.00 for the backtracking.
% 0.19/0.49 0:00:00.01 for the reduction.
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Here is a proof with depth 9, length 24 :
% 0.19/0.49 % SZS output start Refutation
% See solution above
% 0.19/0.49 Formulae used in the proof : axiom_8 axiom_2 axiom_3 axiom_4
% 0.19/0.49
%------------------------------------------------------------------------------