%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS080+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:29 EDT 2022
% Result : Unsatisfiable 0.43s 0.59s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 16
% Syntax : Number of clauses : 40 ( 6 unt; 19 nHn; 40 RR)
% Number of literals : 168 ( 0 equ; 64 neg)
% Maximal clause size : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_19_21224),
file('KRS080+1.p',unknown),
[] ).
cnf(6,axiom,
cp3(skf15(u)),
file('KRS080+1.p',unknown),
[] ).
cnf(7,axiom,
cp2(skf14(u)),
file('KRS080+1.p',unknown),
[] ).
cnf(8,axiom,
cp4(skf13(u)),
file('KRS080+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| cp1(skf11(u)) ),
file('KRS080+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cp1(u)
| ~ cp2(u) ),
file('KRS080+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ cp1(u)
| ~ cp4(u) ),
file('KRS080+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ cp1(u)
| ~ cp3(u) ),
file('KRS080+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ cp2(u)
| ~ cp4(u) ),
file('KRS080+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ cp2(u)
| ~ cp3(u) ),
file('KRS080+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ cp3(u)
| ~ cp4(u) ),
file('KRS080+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf11(u)) ),
file('KRS080+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf13(u)) ),
file('KRS080+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf14(u)) ),
file('KRS080+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf15(u)) ),
file('KRS080+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| ~ rr(u,x)
| ~ rr(u,y)
| equal(x,w)
| equal(y,x)
| equal(y,w)
| equal(v,w)
| equal(v,x)
| equal(v,y) ),
file('KRS080+1.p',unknown),
[] ).
cnf(50,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| ~ rr(u,x)
| equal(w,v)
| equal(x,w)
| equal(x,v)
| equal(skf11(u),v)
| equal(skf11(u),w)
| equal(skf11(u),x) ),
inference(res,[status(thm),theory(equality)],[26,33]),
[iquote('0:Res:26.1,33.1')] ).
cnf(51,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| ~ rr(u,x)
| equal(w,v)
| equal(x,w)
| equal(x,v)
| equal(skf11(u),v)
| equal(skf11(u),w)
| equal(skf11(u),x) ),
inference(obv,[status(thm),theory(equality)],[50]),
[iquote('0:Obv:50.0')] ).
cnf(62,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(v,skf13(u))
| equal(w,v)
| equal(w,skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf11(u),v)
| equal(skf11(u),w) ),
inference(res,[status(thm),theory(equality)],[28,51]),
[iquote('0:Res:28.1,51.1')] ).
cnf(66,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ~ rr(u,w)
| equal(v,skf13(u))
| equal(w,v)
| equal(w,skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf11(u),v)
| equal(skf11(u),w) ),
inference(obv,[status(thm),theory(equality)],[62]),
[iquote('0:Obv:62.0')] ).
cnf(160,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(skf14(u),skf13(u))
| equal(v,skf14(u))
| equal(v,skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf11(u),v) ),
inference(res,[status(thm),theory(equality)],[29,66]),
[iquote('0:Res:29.1,66.1')] ).
cnf(163,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| equal(skf14(u),skf13(u))
| equal(v,skf14(u))
| equal(v,skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf11(u),v) ),
inference(obv,[status(thm),theory(equality)],[160]),
[iquote('0:Obv:160.0')] ).
cnf(169,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf14(u),skf13(u))
| equal(skf15(u),skf14(u))
| equal(skf15(u),skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf15(u),skf11(u)) ),
inference(res,[status(thm),theory(equality)],[30,163]),
[iquote('0:Res:30.1,163.1')] ).
cnf(173,plain,
( ~ cUnsatisfiable(u)
| equal(skf14(u),skf13(u))
| equal(skf15(u),skf14(u))
| equal(skf15(u),skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf15(u),skf11(u)) ),
inference(obv,[status(thm),theory(equality)],[169]),
[iquote('0:Obv:169.0')] ).
cnf(178,plain,
( ~ cUnsatisfiable(u)
| equal(skf14(u),skf13(u))
| equal(skf15(u),skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf15(u),skf11(u))
| cp3(skf14(u)) ),
inference(spr,[status(thm),theory(equality)],[173,6]),
[iquote('0:SpR:173.2,6.0')] ).
cnf(182,plain,
( ~ cUnsatisfiable(u)
| equal(skf15(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf13(u),skf11(u))
| equal(skf15(u),skf13(u))
| equal(skf14(u),skf13(u)) ),
inference(ems,[status(thm)],[22,7,178]),
[iquote('0:EmS:22.0,22.1,7.0,178.6')] ).
cnf(184,plain,
( ~ cUnsatisfiable(u)
| equal(skf15(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf13(u))
| cp3(skf13(u)) ),
inference(spr,[status(thm),theory(equality)],[182,6]),
[iquote('0:SpR:182.4,6.0')] ).
cnf(188,plain,
( ~ cUnsatisfiable(u)
| equal(skf15(u),skf11(u))
| equal(skf14(u),skf11(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf13(u)) ),
inference(ems,[status(thm)],[23,184,8]),
[iquote('0:EmS:23.0,23.1,184.5,8.0')] ).
cnf(189,plain,
( ~ cUnsatisfiable(u)
| equal(skf14(u),skf11(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf13(u))
| cp3(skf11(u)) ),
inference(spr,[status(thm),theory(equality)],[188,6]),
[iquote('0:SpR:188.1,6.0')] ).
cnf(193,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf14(u),skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u)) ),
inference(ems,[status(thm)],[19,13,189]),
[iquote('0:EmS:19.0,19.1,13.1,189.4')] ).
cnf(194,plain,
( ~ cUnsatisfiable(u)
| equal(skf14(u),skf13(u))
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u)) ),
inference(obv,[status(thm),theory(equality)],[193]),
[iquote('0:Obv:193.0')] ).
cnf(196,plain,
( ~ cUnsatisfiable(u)
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u))
| cp2(skf13(u)) ),
inference(spr,[status(thm),theory(equality)],[194,7]),
[iquote('0:SpR:194.1,7.0')] ).
cnf(200,plain,
( ~ cUnsatisfiable(u)
| equal(skf13(u),skf11(u))
| equal(skf14(u),skf11(u)) ),
inference(ems,[status(thm)],[20,196,8]),
[iquote('0:EmS:20.0,20.1,196.3,8.0')] ).
cnf(201,plain,
( ~ cUnsatisfiable(u)
| equal(skf13(u),skf11(u))
| cp2(skf11(u)) ),
inference(spr,[status(thm),theory(equality)],[200,7]),
[iquote('0:SpR:200.2,7.0')] ).
cnf(205,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf13(u),skf11(u)) ),
inference(ems,[status(thm)],[16,13,201]),
[iquote('0:EmS:16.0,16.1,13.1,201.2')] ).
cnf(206,plain,
( ~ cUnsatisfiable(u)
| equal(skf13(u),skf11(u)) ),
inference(obv,[status(thm),theory(equality)],[205]),
[iquote('0:Obv:205.0')] ).
cnf(210,plain,
( ~ cUnsatisfiable(u)
| cp4(skf11(u)) ),
inference(spr,[status(thm),theory(equality)],[206,8]),
[iquote('0:SpR:206.1,8.0')] ).
cnf(212,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[17,13,210]),
[iquote('0:EmS:17.0,17.1,13.1,210.1')] ).
cnf(213,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[212]),
[iquote('0:Obv:212.0')] ).
cnf(214,plain,
$false,
inference(unc,[status(thm)],[213,2]),
[iquote('0:UnC:213.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS080+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 20:26:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/0.59
% 0.43/0.59 SPASS V 3.9
% 0.43/0.59 SPASS beiseite: Proof found.
% 0.43/0.59 % SZS status Theorem
% 0.43/0.59 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.43/0.59 SPASS derived 124 clauses, backtracked 0 clauses, performed 0 splits and kept 94 clauses.
% 0.43/0.59 SPASS allocated 99859 KBytes.
% 0.43/0.59 SPASS spent 0:00:00.24 on the problem.
% 0.43/0.59 0:00:00.04 for the input.
% 0.43/0.59 0:00:00.16 for the FLOTTER CNF translation.
% 0.43/0.59 0:00:00.00 for inferences.
% 0.43/0.59 0:00:00.00 for the backtracking.
% 0.43/0.59 0:00:00.02 for the reduction.
% 0.43/0.59
% 0.43/0.59
% 0.43/0.59 Here is a proof with depth 16, length 40 :
% 0.43/0.59 % SZS output start Refutation
% See solution above
% 0.43/0.59 Formulae used in the proof : axiom_7 axiom_2 axiom_3 axiom_4 axiom_5
% 0.43/0.59
%------------------------------------------------------------------------------