%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO010+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 17:53:47 EDT 2022
% Result : Theorem 0.11s 0.51s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 6 unt; 1 nHn; 19 RR)
% Number of literals : 34 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
occurrence_of(skc1,tptp0),
file('PRO010+1.p',unknown),
[] ).
cnf(32,axiom,
( skP0(u,v)
| min_precedes(u,skf21(u),tptp0) ),
file('PRO010+1.p',unknown),
[] ).
cnf(38,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf37(u),u) ),
file('PRO010+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ leaf(u,v)
| ~ min_precedes(u,w,v) ),
file('PRO010+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ leaf_occ(u,v)
| occurrence_of(v,skf36(u,v)) ),
file('PRO010+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ leaf_occ(u,v)
| leaf(u,skf36(u,w)) ),
file('PRO010+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ occurrence_of(u,v)
| ~ occurrence_of(u,w)
| equal(w,v) ),
file('PRO010+1.p',unknown),
[] ).
cnf(75,axiom,
( ~ skP0(u,v)
| ~ leaf_occ(v,skc1)
| min_precedes(u,skf20(u),tptp0) ),
file('PRO010+1.p',unknown),
[] ).
cnf(98,plain,
( ~ occurrence_of(skc1,u)
| equal(tptp0,u) ),
inference(res,[status(thm),theory(equality)],[6,63]),
[iquote('0:Res:6.0,63.0')] ).
cnf(106,plain,
leaf_occ(skf37(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,38]),
[iquote('0:Res:6.0,38.0')] ).
cnf(130,plain,
( ~ skP0(u,skf37(skc1))
| min_precedes(u,skf20(u),tptp0) ),
inference(res,[status(thm),theory(equality)],[106,75]),
[iquote('0:Res:106.0,75.1')] ).
cnf(278,plain,
( ~ leaf_occ(u,skc1)
| equal(skf36(u,skc1),tptp0) ),
inference(res,[status(thm),theory(equality)],[51,98]),
[iquote('0:Res:51.1,98.0')] ).
cnf(290,plain,
leaf(skf37(skc1),skf36(skf37(skc1),u)),
inference(res,[status(thm),theory(equality)],[106,52]),
[iquote('0:Res:106.0,52.0')] ).
cnf(292,plain,
( ~ leaf_occ(skf37(skc1),skc1)
| leaf(skf37(skc1),tptp0) ),
inference(spr,[status(thm),theory(equality)],[278,290]),
[iquote('0:SpR:278.1,290.0')] ).
cnf(293,plain,
leaf(skf37(skc1),tptp0),
inference(mrr,[status(thm)],[292,106]),
[iquote('0:MRR:292.0,106.0')] ).
cnf(344,plain,
( ~ leaf(u,tptp0)
| skP0(u,v) ),
inference(res,[status(thm),theory(equality)],[32,45]),
[iquote('0:Res:32.1,45.1')] ).
cnf(427,plain,
( ~ skP0(u,skf37(skc1))
| ~ leaf(u,tptp0) ),
inference(res,[status(thm),theory(equality)],[130,45]),
[iquote('0:Res:130.1,45.1')] ).
cnf(429,plain,
~ leaf(u,tptp0),
inference(mrr,[status(thm)],[427,344]),
[iquote('0:MRR:427.0,344.1')] ).
cnf(430,plain,
$false,
inference(unc,[status(thm)],[429,293]),
[iquote('0:UnC:429.0,293.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : PRO010+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.08 % Command : run_spass %d %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Mon Jun 13 03:42:56 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.11/0.51
% 0.11/0.51 SPASS V 3.9
% 0.11/0.51 SPASS beiseite: Proof found.
% 0.11/0.51 % SZS status Theorem
% 0.11/0.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.51 SPASS derived 286 clauses, backtracked 66 clauses, performed 6 splits and kept 314 clauses.
% 0.11/0.51 SPASS allocated 100041 KBytes.
% 0.11/0.51 SPASS spent 0:00:00.23 on the problem.
% 0.11/0.51 0:00:00.03 for the input.
% 0.11/0.51 0:00:00.14 for the FLOTTER CNF translation.
% 0.11/0.51 0:00:00.00 for inferences.
% 0.11/0.51 0:00:00.00 for the backtracking.
% 0.11/0.51 0:00:00.02 for the reduction.
% 0.11/0.51
% 0.11/0.51
% 0.11/0.51 Here is a proof with depth 3, length 19 :
% 0.11/0.51 % SZS output start Refutation
% See solution above
% 0.11/0.51 Formulae used in the proof : goals sos_35 sos_21 sos_34 sos_02
% 0.11/0.51
%------------------------------------------------------------------------------