TSTP Solution File: KRS104+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS104+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:34 EDT 2022
% Result : Unsatisfiable 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of clauses : 44 ( 10 unt; 6 nHn; 44 RR)
% Number of literals : 81 ( 0 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_20_50869),
file('KRS104+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ ca(u)
| ca_Cx1(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ cb(u)
| ccxcomp(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ ca_Cx1(u)
| cbxcomp(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ ca_Cx1(u)
| ccxcomp(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ ca_Cx6xcomp(u)
| ca(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ ca_Cx6xcomp(u)
| cb(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ ca_Cx7xcomp(u)
| cc(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ ca_Cx7xcomp(u)
| ca(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ ca_Cx8xcomp(u)
| cc(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ ca_Cx8xcomp(u)
| cb(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(27,axiom,
( ca_Cx6(u)
| ra_Px6(u,skf22(u)) ),
file('KRS104+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ ra_Px6(u,v)
| ca_Cx6xcomp(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ ra_Px7(u,v)
| ca_Cx7(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(30,axiom,
( ca_Cx7xcomp(u)
| ra_Px7(u,skf25(u)) ),
file('KRS104+1.p',unknown),
[] ).
cnf(31,axiom,
( ca_Cx8(u)
| ra_Px8(u,skf26(u)) ),
file('KRS104+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ ra_Px8(u,v)
| ca_Cx8xcomp(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ cUnsatisfiable(u)
| ~ ra_Px5(u,v) ),
file('KRS104+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ cUnsatisfiablexcomp(u)
| ra_Px5(u,skf15(u)) ),
file('KRS104+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ cb(u)
| ra_Px3(u,skf16(u)) ),
file('KRS104+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ cbxcomp(u)
| ~ ra_Px3(u,v) ),
file('KRS104+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ cc(u)
| ra_Px2(u,skf18(u)) ),
file('KRS104+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ ccxcomp(u)
| ~ ra_Px2(u,v) ),
file('KRS104+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ ca_Cx6(u)
| ~ ca_Cx8(u)
| ~ ca_Cx7(u)
| cUnsatisfiablexcomp(u) ),
file('KRS104+1.p',unknown),
[] ).
cnf(88,plain,
( ca_Cx7xcomp(u)
| ca_Cx7(u) ),
inference(res,[status(thm),theory(equality)],[30,29]),
[iquote('0:Res:30.1,29.0')] ).
cnf(89,plain,
( ca_Cx8(u)
| ca_Cx8xcomp(u) ),
inference(res,[status(thm),theory(equality)],[31,32]),
[iquote('0:Res:31.1,32.0')] ).
cnf(90,plain,
( ca_Cx6(u)
| ca_Cx6xcomp(u) ),
inference(res,[status(thm),theory(equality)],[27,28]),
[iquote('0:Res:27.1,28.0')] ).
cnf(105,plain,
( ~ cUnsatisfiablexcomp(u)
| ~ cUnsatisfiable(u) ),
inference(res,[status(thm),theory(equality)],[34,33]),
[iquote('0:Res:34.1,33.1')] ).
cnf(111,plain,
( ~ cb(u)
| ~ cbxcomp(u) ),
inference(res,[status(thm),theory(equality)],[35,36]),
[iquote('0:Res:35.1,36.1')] ).
cnf(113,plain,
( ~ ca_Cx6xcomp(u)
| ~ ca_Cx1(u) ),
inference(ems,[status(thm)],[111,13,10]),
[iquote('0:EmS:111.0,111.1,13.1,10.1')] ).
cnf(116,plain,
~ ca_Cx6xcomp(u),
inference(ssi,[status(thm)],[113,12,8]),
[iquote('0:SSi:113.1,12.1,8.1')] ).
cnf(118,plain,
ca_Cx6(u),
inference(mrr,[status(thm)],[90,116]),
[iquote('0:MRR:90.1,116.0')] ).
cnf(121,plain,
( ~ ca_Cx8(u)
| ~ ca_Cx7(u)
| cUnsatisfiablexcomp(u) ),
inference(mrr,[status(thm)],[51,118]),
[iquote('0:MRR:51.0,118.0')] ).
cnf(126,plain,
( ~ cc(u)
| ~ ccxcomp(u) ),
inference(res,[status(thm),theory(equality)],[37,38]),
[iquote('0:Res:37.1,38.1')] ).
cnf(128,plain,
( ~ ca_Cx7xcomp(u)
| ~ ca_Cx1(u) ),
inference(ems,[status(thm)],[126,14,11]),
[iquote('0:EmS:126.0,126.1,14.1,11.1')] ).
cnf(129,plain,
( ~ ca_Cx8xcomp(u)
| ~ cb(u) ),
inference(ems,[status(thm)],[126,16,9]),
[iquote('0:EmS:126.0,126.1,16.1,9.1')] ).
cnf(133,plain,
~ ca_Cx7xcomp(u),
inference(ssi,[status(thm)],[128,15,8]),
[iquote('0:SSi:128.1,15.1,8.1')] ).
cnf(135,plain,
ca_Cx7(u),
inference(mrr,[status(thm)],[88,133]),
[iquote('0:MRR:88.0,133.0')] ).
cnf(138,plain,
( ~ ca_Cx8(u)
| cUnsatisfiablexcomp(u) ),
inference(mrr,[status(thm)],[121,135]),
[iquote('0:MRR:121.1,135.0')] ).
cnf(139,plain,
~ ca_Cx8xcomp(u),
inference(ssi,[status(thm)],[129,17]),
[iquote('0:SSi:129.1,17.1')] ).
cnf(141,plain,
ca_Cx8(u),
inference(mrr,[status(thm)],[89,139]),
[iquote('0:MRR:89.1,139.0')] ).
cnf(144,plain,
cUnsatisfiablexcomp(u),
inference(mrr,[status(thm)],[138,141]),
[iquote('0:MRR:138.0,141.0')] ).
cnf(146,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[105,144]),
[iquote('0:MRR:105.0,144.0')] ).
cnf(147,plain,
$false,
inference(unc,[status(thm)],[146,2]),
[iquote('0:UnC:146.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : KRS104+1 : TPTP v8.1.0. Released v3.1.0.
% 0.09/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.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 09:34:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43
% 0.18/0.43 SPASS V 3.9
% 0.18/0.43 SPASS beiseite: Proof found.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 SPASS derived 56 clauses, backtracked 0 clauses, performed 0 splits and kept 85 clauses.
% 0.18/0.43 SPASS allocated 97686 KBytes.
% 0.18/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.43 0:00:00.04 for the input.
% 0.18/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43 0:00:00.00 for inferences.
% 0.18/0.43 0:00:00.00 for the backtracking.
% 0.18/0.43 0:00:00.00 for the reduction.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Here is a proof with depth 2, length 44 :
% 0.18/0.43 % SZS output start Refutation
% See solution above
% 0.18/0.43 Formulae used in the proof : axiom_23 axiom_5 axiom_7 axiom_11 axiom_15 axiom_18 axiom_22 axiom_14 axiom_16 axiom_17 axiom_19 axiom_20 axiom_21 axiom_2 axiom_4 axiom_6 axiom_8 axiom_9 axiom_10 axiom_3
% 0.18/0.43
%------------------------------------------------------------------------------