%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN069+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 : Thu Jul 21 12:18:18 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 8 unt; 1 nHn; 21 RR)
% Number of literals : 39 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 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(1,axiom,
big(skc1),
file('SYN069+1.p',unknown),
[] ).
cnf(3,axiom,
big_g(skf3(u)),
file('SYN069+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ skP0(u)
| big_k(v) ),
file('SYN069+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ skP0(u)
| big_h(u,v) ),
file('SYN069+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big_k(u)
| ~ big_l(u) ),
file('SYN069+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ big_h(skc1,u)
| big_l(u) ),
file('SYN069+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ big(u)
| big_h(u,skf3(u))
| skP0(u) ),
file('SYN069+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ big(u)
| ~ big_j(u,skf3(u))
| skP0(u) ),
file('SYN069+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ big_g(u)
| ~ big_h(skc1,u)
| big_j(skc1,u) ),
file('SYN069+1.p',unknown),
[] ).
cnf(13,plain,
( ~ big(u)
| big_h(u,skf3(u)) ),
inference(mrr,[status(thm)],[10,6]),
[iquote('0:MRR:10.2,6.0')] ).
cnf(24,plain,
( ~ skP0(skc1)
| big_l(u) ),
inference(res,[status(thm),theory(equality)],[6,8]),
[iquote('0:Res:6.1,8.0')] ).
cnf(26,plain,
( ~ big(skc1)
| big_l(skf3(skc1)) ),
inference(res,[status(thm),theory(equality)],[13,8]),
[iquote('0:Res:13.1,8.0')] ).
cnf(27,plain,
big_l(skf3(skc1)),
inference(ssi,[status(thm)],[26,1]),
[iquote('0:SSi:26.0,1.0')] ).
cnf(28,plain,
( ~ big_g(skf3(skc1))
| ~ big(skc1)
| ~ big_h(skc1,skf3(skc1))
| skP0(skc1) ),
inference(res,[status(thm),theory(equality)],[12,11]),
[iquote('0:Res:12.2,11.1')] ).
cnf(29,plain,
( ~ big_h(skc1,skf3(skc1))
| skP0(skc1) ),
inference(ssi,[status(thm)],[28,1,27,3]),
[iquote('0:SSi:28.1,28.0,1.0,27.0,3.0,1.0')] ).
cnf(31,plain,
( ~ big(skc1)
| skP0(skc1) ),
inference(res,[status(thm),theory(equality)],[13,29]),
[iquote('0:Res:13.1,29.0')] ).
cnf(32,plain,
skP0(skc1),
inference(ssi,[status(thm)],[31,1]),
[iquote('0:SSi:31.0,1.0')] ).
cnf(33,plain,
big_l(u),
inference(mrr,[status(thm)],[24,32]),
[iquote('0:MRR:24.0,32.0')] ).
cnf(34,plain,
~ big_k(u),
inference(mrr,[status(thm)],[7,33]),
[iquote('0:MRR:7.1,33.0')] ).
cnf(35,plain,
~ skP0(u),
inference(mrr,[status(thm)],[5,34]),
[iquote('0:MRR:5.1,34.0')] ).
cnf(36,plain,
$false,
inference(unc,[status(thm)],[35,32]),
[iquote('0:UnC:35.0,32.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN069+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 18:19:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.18/0.44 SPASS allocated 97589 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.44 0:00:00.04 for the input.
% 0.18/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.00 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 2, length 21 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : pel45_3 pel45_1 pel45 pel45_2
% 0.18/0.44
%------------------------------------------------------------------------------