%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS100+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:33 EDT 2022
% Result : Unsatisfiable 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 4 unt; 0 nHn; 10 RR)
% Number of literals : 21 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
cUnsatisfiable(i2003_11_14_17_20_32704),
file('KRS100+1.p',unknown),
[] ).
cnf(7,axiom,
~ ce(skf3(u)),
file('KRS100+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ cUnsatisfiable(u)
| rr(u,skf3(u)) ),
file('KRS100+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| cd(v) ),
file('KRS100+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ cd(u)
| ~ cUnsatisfiable(v)
| ~ rr(v,u)
| ce(u) ),
file('KRS100+1.p',unknown),
[] ).
cnf(15,plain,
( ~ cUnsatisfiable(u)
| ~ rr(u,v)
| ce(v) ),
inference(mrr,[status(thm)],[12,11]),
[iquote('0:MRR:12.0,11.2')] ).
cnf(29,plain,
( ~ cUnsatisfiable(u)
| ~ cUnsatisfiable(u)
| ce(skf3(u)) ),
inference(res,[status(thm),theory(equality)],[10,15]),
[iquote('0:Res:10.1,15.1')] ).
cnf(30,plain,
( ~ cUnsatisfiable(u)
| ce(skf3(u)) ),
inference(obv,[status(thm),theory(equality)],[29]),
[iquote('0:Obv:29.0')] ).
cnf(31,plain,
~ cUnsatisfiable(u),
inference(mrr,[status(thm)],[30,7]),
[iquote('0:MRR:30.1,7.0')] ).
cnf(32,plain,
$false,
inference(unc,[status(thm)],[31,2]),
[iquote('0:UnC:31.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS100+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 7 14:49:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.46
% 0.21/0.46 SPASS V 3.9
% 0.21/0.46 SPASS beiseite: Proof found.
% 0.21/0.46 % SZS status Theorem
% 0.21/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.46 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.21/0.46 SPASS allocated 97758 KBytes.
% 0.21/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.21/0.46 0:00:00.04 for the input.
% 0.21/0.46 0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.46 0:00:00.00 for inferences.
% 0.21/0.46 0:00:00.00 for the backtracking.
% 0.21/0.46 0:00:00.00 for the reduction.
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Here is a proof with depth 1, length 10 :
% 0.21/0.46 % SZS output start Refutation
% See solution above
% 0.21/0.46 Formulae used in the proof : axiom_4 axiom_2
% 0.21/0.46
%------------------------------------------------------------------------------