TSTP Solution File: KRS106+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS106+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:34 EDT 2022
% Result : Unsatisfiable 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 26 ( 5 unt; 0 nHn; 26 RR)
% Number of literals : 53 ( 0 equ; 31 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_20_57644),
file('KRS106+1.p',unknown),
[] ).
cnf(4,axiom,
cp1xcomp(skf7(u)),
file('KRS106+1.p',unknown),
[] ).
cnf(5,axiom,
cp1(skf6(u)),
file('KRS106+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| rf3(u,skf5(u)) ),
file('KRS106+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cUnsatisfiable(u)
| rf1(u,skf6(u)) ),
file('KRS106+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ cUnsatisfiable(u)
| rf2(u,skf7(u)) ),
file('KRS106+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ cp1(u)
| ~ ra_Px1(u,v) ),
file('KRS106+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ cp1xcomp(u)
| ra_Px1(u,skf9(u)) ),
file('KRS106+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ rf3(u,v)
| rf1(u,v) ),
file('KRS106+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ rf3(u,v)
| rf2(u,v) ),
file('KRS106+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ rf1(u,v)
| ~ rf1(u,w)
| equal(w,v) ),
file('KRS106+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ rf2(u,v)
| ~ rf2(u,w)
| equal(w,v) ),
file('KRS106+1.p',unknown),
[] ).
cnf(25,plain,
( ~ cp1xcomp(u)
| ~ cp1(u) ),
inference(res,[status(thm),theory(equality)],[15,14]),
[iquote('0:Res:15.1,14.1')] ).
cnf(27,plain,
( ~ cUnsatisfiable(u)
| rf2(u,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[11,17]),
[iquote('0:Res:11.1,17.0')] ).
cnf(28,plain,
( ~ cUnsatisfiable(u)
| rf1(u,skf5(u)) ),
inference(res,[status(thm),theory(equality)],[11,16]),
[iquote('0:Res:11.1,16.0')] ).
cnf(29,plain,
( ~ cUnsatisfiable(u)
| ~ rf2(u,v)
| equal(v,skf7(u)) ),
inference(res,[status(thm),theory(equality)],[13,19]),
[iquote('0:Res:13.1,19.0')] ).
cnf(32,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf7(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[27,29]),
[iquote('0:Res:27.1,29.1')] ).
cnf(33,plain,
( ~ cUnsatisfiable(u)
| equal(skf7(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[32]),
[iquote('0:Obv:32.0')] ).
cnf(36,plain,
( ~ cUnsatisfiable(u)
| cp1xcomp(skf5(u)) ),
inference(spr,[status(thm),theory(equality)],[33,4]),
[iquote('0:SpR:33.1,4.0')] ).
cnf(38,plain,
( ~ cUnsatisfiable(u)
| ~ rf1(u,v)
| equal(v,skf6(u)) ),
inference(res,[status(thm),theory(equality)],[12,18]),
[iquote('0:Res:12.1,18.0')] ).
cnf(43,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(res,[status(thm),theory(equality)],[28,38]),
[iquote('0:Res:28.1,38.1')] ).
cnf(44,plain,
( ~ cUnsatisfiable(u)
| equal(skf6(u),skf5(u)) ),
inference(obv,[status(thm),theory(equality)],[43]),
[iquote('0:Obv:43.0')] ).
cnf(47,plain,
( ~ cUnsatisfiable(u)
| cp1(skf5(u)) ),
inference(spr,[status(thm),theory(equality)],[44,5]),
[iquote('0:SpR:44.1,5.0')] ).
cnf(50,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u) ),
inference(ems,[status(thm)],[25,36,47]),
[iquote('0:EmS:25.0,25.1,36.1,47.1')] ).
cnf(51,plain,
~ cUnsatisfiable(u),
inference(obv,[status(thm),theory(equality)],[50]),
[iquote('0:Obv:50.0')] ).
cnf(52,plain,
$false,
inference(unc,[status(thm)],[51,2]),
[iquote('0:UnC:51.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.08 % Problem : KRS106+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.09 % Command : run_spass %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Tue Jun 7 14:08:35 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.12/0.36
% 0.12/0.36 SPASS V 3.9
% 0.12/0.36 SPASS beiseite: Proof found.
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 SPASS derived 27 clauses, backtracked 0 clauses, performed 0 splits and kept 35 clauses.
% 0.12/0.36 SPASS allocated 97851 KBytes.
% 0.12/0.36 SPASS spent 0:00:00.07 on the problem.
% 0.12/0.36 0:00:00.03 for the input.
% 0.12/0.36 0:00:00.03 for the FLOTTER CNF translation.
% 0.12/0.36 0:00:00.00 for inferences.
% 0.12/0.36 0:00:00.00 for the backtracking.
% 0.12/0.36 0:00:00.00 for the reduction.
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Here is a proof with depth 4, length 26 :
% 0.12/0.36 % SZS output start Refutation
% See solution above
% 0.12/0.36 Formulae used in the proof : axiom_8 axiom_2 axiom_3 axiom_4 axiom_9 axiom_10 axiom_5 axiom_6
% 0.12/0.36
%------------------------------------------------------------------------------