%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:17 EDT 2022
% Result : Unsatisfiable 0.13s 0.41s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 5 unt; 0 nHn; 9 RR)
% Number of literals : 16 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ e(u)
| r(u,u0r3(u)) ),
file('KRS017-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ e(u)
| ~ r(v,w)
| ~ r(u,w)
| a(v) ),
file('KRS017-1.p',unknown),
[] ).
cnf(6,axiom,
e(exists__dfg),
file('KRS017-1.p',unknown),
[] ).
cnf(7,axiom,
~ a(exists__dfg),
file('KRS017-1.p',unknown),
[] ).
cnf(9,plain,
r(exists__dfg,u0r3(exists__dfg)),
inference(res,[status(thm),theory(equality)],[6,1]),
[iquote('0:Res:6.0,1.0')] ).
cnf(10,plain,
( ~ e(u)
| ~ r(u,v)
| ~ r(exists__dfg,v) ),
inference(res,[status(thm),theory(equality)],[2,7]),
[iquote('0:Res:2.3,7.0')] ).
cnf(11,plain,
( ~ r(exists__dfg,u)
| ~ r(exists__dfg,u) ),
inference(res,[status(thm),theory(equality)],[6,10]),
[iquote('0:Res:6.0,10.0')] ).
cnf(13,plain,
~ r(exists__dfg,u),
inference(obv,[status(thm),theory(equality)],[11]),
[iquote('0:Obv:11.0')] ).
cnf(14,plain,
$false,
inference(unc,[status(thm)],[13,9]),
[iquote('0:UnC:13.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 13:56:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.41
% 0.13/0.41 SPASS V 3.9
% 0.13/0.41 SPASS beiseite: Proof found.
% 0.13/0.41 % SZS status Theorem
% 0.13/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.13/0.41 SPASS allocated 75584 KBytes.
% 0.13/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.13/0.41 0:00:00.03 for the input.
% 0.13/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.13/0.41 0:00:00.00 for inferences.
% 0.13/0.41 0:00:00.00 for the backtracking.
% 0.13/0.41 0:00:00.00 for the reduction.
% 0.13/0.41
% 0.13/0.41
% 0.13/0.41 Here is a proof with depth 2, length 9 :
% 0.13/0.41 % SZS output start Refutation
% See solution above
% 0.13/0.41 Formulae used in the proof : clause_3 clause_4 clause_1 clause_2
% 0.13/0.41
%------------------------------------------------------------------------------