%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO010+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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.34s 0.52s
% Output : Refutation 0.34s
% 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+4.p',unknown),
[] ).
cnf(33,axiom,
( skP0(u,v)
| min_precedes(u,skf18(u),tptp0) ),
file('PRO010+4.p',unknown),
[] ).
cnf(38,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf31(u),u) ),
file('PRO010+4.p',unknown),
[] ).
cnf(43,axiom,
( ~ leaf(u,v)
| ~ min_precedes(u,w,v) ),
file('PRO010+4.p',unknown),
[] ).
cnf(46,axiom,
( ~ leaf_occ(u,v)
| occurrence_of(v,skf27(u,v)) ),
file('PRO010+4.p',unknown),
[] ).
cnf(47,axiom,
( ~ leaf_occ(u,v)
| leaf(u,skf27(u,w)) ),
file('PRO010+4.p',unknown),
[] ).
cnf(64,axiom,
( ~ occurrence_of(u,v)
| ~ occurrence_of(u,w)
| equal(w,v) ),
file('PRO010+4.p',unknown),
[] ).
cnf(68,axiom,
( ~ skP0(u,v)
| ~ leaf_occ(v,skc1)
| min_precedes(u,skf17(u),tptp0) ),
file('PRO010+4.p',unknown),
[] ).
cnf(95,plain,
( ~ occurrence_of(skc1,u)
| equal(tptp0,u) ),
inference(res,[status(thm),theory(equality)],[6,64]),
[iquote('0:Res:6.0,64.0')] ).
cnf(102,plain,
leaf_occ(skf31(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,38]),
[iquote('0:Res:6.0,38.0')] ).
cnf(118,plain,
( ~ skP0(u,skf31(skc1))
| min_precedes(u,skf17(u),tptp0) ),
inference(res,[status(thm),theory(equality)],[102,68]),
[iquote('0:Res:102.0,68.1')] ).
cnf(349,plain,
( ~ leaf_occ(u,skc1)
| equal(skf27(u,skc1),tptp0) ),
inference(res,[status(thm),theory(equality)],[46,95]),
[iquote('0:Res:46.1,95.0')] ).
cnf(369,plain,
leaf(skf31(skc1),skf27(skf31(skc1),u)),
inference(res,[status(thm),theory(equality)],[102,47]),
[iquote('0:Res:102.0,47.0')] ).
cnf(371,plain,
( ~ leaf_occ(skf31(skc1),skc1)
| leaf(skf31(skc1),tptp0) ),
inference(spr,[status(thm),theory(equality)],[349,369]),
[iquote('0:SpR:349.1,369.0')] ).
cnf(372,plain,
leaf(skf31(skc1),tptp0),
inference(mrr,[status(thm)],[371,102]),
[iquote('0:MRR:371.0,102.0')] ).
cnf(377,plain,
( ~ leaf(u,tptp0)
| skP0(u,v) ),
inference(res,[status(thm),theory(equality)],[33,43]),
[iquote('0:Res:33.1,43.1')] ).
cnf(430,plain,
( ~ skP0(u,skf31(skc1))
| ~ leaf(u,tptp0) ),
inference(res,[status(thm),theory(equality)],[118,43]),
[iquote('0:Res:118.1,43.1')] ).
cnf(435,plain,
~ leaf(u,tptp0),
inference(mrr,[status(thm)],[430,377]),
[iquote('0:MRR:430.0,377.1')] ).
cnf(436,plain,
$false,
inference(unc,[status(thm)],[435,372]),
[iquote('0:UnC:435.0,372.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PRO010+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 01:31:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.34/0.52
% 0.34/0.52 SPASS V 3.9
% 0.34/0.52 SPASS beiseite: Proof found.
% 0.34/0.52 % SZS status Theorem
% 0.34/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.34/0.52 SPASS derived 301 clauses, backtracked 68 clauses, performed 6 splits and kept 315 clauses.
% 0.34/0.52 SPASS allocated 99261 KBytes.
% 0.34/0.52 SPASS spent 0:00:00.17 on the problem.
% 0.34/0.52 0:00:00.04 for the input.
% 0.34/0.52 0:00:00.08 for the FLOTTER CNF translation.
% 0.34/0.52 0:00:00.00 for inferences.
% 0.34/0.52 0:00:00.00 for the backtracking.
% 0.34/0.52 0:00:00.02 for the reduction.
% 0.34/0.52
% 0.34/0.52
% 0.34/0.52 Here is a proof with depth 3, length 19 :
% 0.34/0.52 % SZS output start Refutation
% See solution above
% 0.34/0.52 Formulae used in the proof : goals sos_32 sos_15 sos_18 sos_08
% 0.34/0.52
%------------------------------------------------------------------------------