%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO011+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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 : Mon Jul 18 17:53:48 EDT 2022
% Result : Theorem 0.37s 0.59s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 4 unt; 1 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
occurrence_of(skc1,tptp0),
file('PRO011+2.p',unknown),
[] ).
cnf(37,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf35(u),u) ),
file('PRO011+2.p',unknown),
[] ).
cnf(53,axiom,
( skP0(u,v,w)
| min_precedes(u,skf20(u,x),tptp0) ),
file('PRO011+2.p',unknown),
[] ).
cnf(79,axiom,
( ~ leaf_occ(u,v)
| ~ occurrence_of(v,w)
| ~ min_precedes(u,x,w) ),
file('PRO011+2.p',unknown),
[] ).
cnf(80,axiom,
( ~ leaf_occ(u,skc1)
| ~ skP0(v,skc1,u)
| min_precedes(v,skf19(v),tptp0) ),
file('PRO011+2.p',unknown),
[] ).
cnf(96,plain,
( ~ leaf_occ(u,skc1)
| ~ min_precedes(u,v,tptp0) ),
inference(res,[status(thm),theory(equality)],[6,79]),
[iquote('0:Res:6.0,79.0')] ).
cnf(106,plain,
leaf_occ(skf35(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,37]),
[iquote('0:Res:6.0,37.0')] ).
cnf(368,plain,
( ~ leaf_occ(u,skc1)
| skP0(u,v,w) ),
inference(res,[status(thm),theory(equality)],[53,96]),
[iquote('0:Res:53.1,96.1')] ).
cnf(796,plain,
( ~ leaf_occ(u,skc1)
| ~ leaf_occ(v,skc1)
| min_precedes(u,skf19(u),tptp0) ),
inference(res,[status(thm),theory(equality)],[368,80]),
[iquote('0:Res:368.1,80.1')] ).
cnf(804,plain,
( ~ leaf_occ(u,skc1)
| min_precedes(u,skf19(u),tptp0) ),
inference(con,[status(thm)],[796]),
[iquote('0:Con:796.1')] ).
cnf(805,plain,
~ leaf_occ(u,skc1),
inference(mrr,[status(thm)],[804,96]),
[iquote('0:MRR:804.1,96.1')] ).
cnf(806,plain,
$false,
inference(unc,[status(thm)],[805,106]),
[iquote('0:UnC:805.0,106.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO011+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.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 : Mon Jun 13 02:11:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.37/0.59
% 0.37/0.59 SPASS V 3.9
% 0.37/0.59 SPASS beiseite: Proof found.
% 0.37/0.59 % SZS status Theorem
% 0.37/0.59 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.59 SPASS derived 645 clauses, backtracked 22 clauses, performed 3 splits and kept 451 clauses.
% 0.37/0.59 SPASS allocated 99453 KBytes.
% 0.37/0.59 SPASS spent 0:00:00.22 on the problem.
% 0.37/0.59 0:00:00.04 for the input.
% 0.37/0.59 0:00:00.09 for the FLOTTER CNF translation.
% 0.37/0.59 0:00:00.01 for inferences.
% 0.37/0.59 0:00:00.00 for the backtracking.
% 0.37/0.59 0:00:00.05 for the reduction.
% 0.37/0.59
% 0.37/0.59
% 0.37/0.59 Here is a proof with depth 3, length 12 :
% 0.37/0.59 % SZS output start Refutation
% See solution above
% 0.37/0.59 Formulae used in the proof : goals sos_32 sos_21
% 0.37/0.59
%------------------------------------------------------------------------------