TSTP Solution File: KRS086+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS086+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:31 EDT 2022
% Result : Unsatisfiable 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 26 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
cowlThing(u),
file('KRS086+1.p',unknown),
[] ).
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_19_42328),
file('KRS086+1.p',unknown),
[] ).
cnf(4,axiom,
cp1(skf3(u)),
file('KRS086+1.p',unknown),
[] ).
cnf(6,axiom,
~ cp1(skf5(u)),
file('KRS086+1.p',unknown),
[] ).
cnf(7,axiom,
rf(skf4(u),skf5(u)),
file('KRS086+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ rinvF(u,v)
| rf(v,u) ),
file('KRS086+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cUnsatisfiable(u)
| rinvF(skf3(u),skf4(u)) ),
file('KRS086+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ cowlThing(u)
| ~ rf(u,v)
| ~ rf(u,w)
| equal(v,w) ),
file('KRS086+1.p',unknown),
[] ).
cnf(18,plain,
( ~ rf(u,v)
| ~ rf(u,w)
| equal(w,v) ),
inference(mrr,[status(thm)],[16,1]),
[iquote('0:MRR:16.0,1.0')] ).
cnf(20,plain,
( ~ cUnsatisfiable(u)
| rf(skf4(u),skf3(u)) ),
inference(res,[status(thm),theory(equality)],[14,10]),
[iquote('0:Res:14.1,10.0')] ).
cnf(21,plain,
( ~ rf(skf4(u),v)
| equal(v,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[7,18]),
[iquote('0:Res:7.0,18.0')] ).
cnf(25,plain,
( ~ cUnsatisfiable(u)
| equal(skf5(u),skf3(u)) ),
inference(res,[status(thm),theory(equality)],[20,21]),
[iquote('0:Res:20.1,21.0')] ).
cnf(29,plain,
( ~ cUnsatisfiable(u)
| ~ cp1(skf3(u)) ),
inference(spl,[status(thm),theory(equality)],[25,6]),
[iquote('0:SpL:25.1,6.0')] ).
cnf(30,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[29,4]),
[iquote('0:MRR:29.1,4.0')] ).
cnf(31,plain,
$false,
inference(unc,[status(thm)],[30,2]),
[iquote('0:UnC:30.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : KRS086+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.10 % Command : run_spass %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue Jun 7 18:50:21 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.39
% 0.15/0.39 SPASS V 3.9
% 0.15/0.39 SPASS beiseite: Proof found.
% 0.15/0.39 % SZS status Theorem
% 0.15/0.39 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.39 SPASS derived 11 clauses, backtracked 0 clauses, performed 0 splits and kept 23 clauses.
% 0.15/0.39 SPASS allocated 97845 KBytes.
% 0.15/0.39 SPASS spent 0:00:00.08 on the problem.
% 0.15/0.39 0:00:00.03 for the input.
% 0.15/0.39 0:00:00.03 for the FLOTTER CNF translation.
% 0.15/0.39 0:00:00.00 for inferences.
% 0.15/0.39 0:00:00.00 for the backtracking.
% 0.15/0.39 0:00:00.00 for the reduction.
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 Here is a proof with depth 3, length 15 :
% 0.15/0.39 % SZS output start Refutation
% See solution above
% 0.15/0.39 Formulae used in the proof : axiom_0 axiom_7 axiom_2 axiom_4 axiom_3
% 0.15/0.39
%------------------------------------------------------------------------------