%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO010+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:47 EDT 2022
% Result : Theorem 0.22s 0.56s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 25 ( 9 unt; 2 nHn; 25 RR)
% Number of literals : 45 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
occurrence_of(skc1,tptp0),
file('PRO010+2.p',unknown),
[] ).
cnf(8,axiom,
~ atomic(tptp0),
file('PRO010+2.p',unknown),
[] ).
cnf(9,axiom,
atomic(skf26(u,v)),
file('PRO010+2.p',unknown),
[] ).
cnf(34,axiom,
( skP0(u,v)
| min_precedes(u,skf20(u),tptp0) ),
file('PRO010+2.p',unknown),
[] ).
cnf(39,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf35(u),u) ),
file('PRO010+2.p',unknown),
[] ).
cnf(46,axiom,
( ~ arboreal(u)
| ~ occurrence_of(u,v)
| atomic(v) ),
file('PRO010+2.p',unknown),
[] ).
cnf(47,axiom,
( ~ atomic(u)
| ~ occurrence_of(v,u)
| arboreal(v) ),
file('PRO010+2.p',unknown),
[] ).
cnf(50,axiom,
( ~ atocc(u,v)
| occurrence_of(u,skf26(u,v)) ),
file('PRO010+2.p',unknown),
[] ).
cnf(58,axiom,
( ~ min_precedes(u,v,w)
| atocc(u,skf32(u,x)) ),
file('PRO010+2.p',unknown),
[] ).
cnf(63,axiom,
( ~ occurrence_of(u,v)
| ~ occurrence_of(u,w)
| equal(w,v) ),
file('PRO010+2.p',unknown),
[] ).
cnf(74,axiom,
( ~ skP0(u,v)
| ~ leaf_occ(v,skc1)
| min_precedes(u,skf19(u),tptp0) ),
file('PRO010+2.p',unknown),
[] ).
cnf(95,plain,
( ~ occurrence_of(skc1,u)
| equal(tptp0,u) ),
inference(res,[status(thm),theory(equality)],[6,63]),
[iquote('0:Res:6.0,63.0')] ).
cnf(98,plain,
( ~ arboreal(skc1)
| atomic(tptp0) ),
inference(res,[status(thm),theory(equality)],[6,46]),
[iquote('0:Res:6.0,46.1')] ).
cnf(104,plain,
leaf_occ(skf35(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,39]),
[iquote('0:Res:6.0,39.0')] ).
cnf(106,plain,
( ~ atomic(tptp0)
| arboreal(skc1) ),
inference(res,[status(thm),theory(equality)],[6,47]),
[iquote('0:Res:6.0,47.1')] ).
cnf(110,plain,
~ arboreal(skc1),
inference(mrr,[status(thm)],[98,8]),
[iquote('0:MRR:98.1,8.0')] ).
cnf(111,plain,
~ atomic(tptp0),
inference(mrr,[status(thm)],[106,110]),
[iquote('0:MRR:106.1,110.0')] ).
cnf(118,plain,
( ~ skP0(u,skf35(skc1))
| min_precedes(u,skf19(u),tptp0) ),
inference(res,[status(thm),theory(equality)],[104,74]),
[iquote('0:Res:104.0,74.1')] ).
cnf(272,plain,
( ~ atocc(skc1,u)
| equal(skf26(skc1,u),tptp0) ),
inference(res,[status(thm),theory(equality)],[50,95]),
[iquote('0:Res:50.1,95.0')] ).
cnf(336,plain,
( ~ atocc(skc1,u)
| atomic(tptp0) ),
inference(spr,[status(thm),theory(equality)],[272,9]),
[iquote('0:SpR:272.1,9.0')] ).
cnf(341,plain,
~ atocc(skc1,u),
inference(mrr,[status(thm)],[336,111]),
[iquote('0:MRR:336.1,111.0')] ).
cnf(441,plain,
( skP0(u,v)
| atocc(u,skf32(u,w)) ),
inference(res,[status(thm),theory(equality)],[34,58]),
[iquote('0:Res:34.1,58.0')] ).
cnf(475,plain,
( ~ skP0(u,skf35(skc1))
| atocc(u,skf32(u,v)) ),
inference(res,[status(thm),theory(equality)],[118,58]),
[iquote('0:Res:118.1,58.0')] ).
cnf(488,plain,
atocc(u,skf32(u,v)),
inference(mrr,[status(thm)],[475,441]),
[iquote('0:MRR:475.0,441.0')] ).
cnf(489,plain,
$false,
inference(unc,[status(thm)],[488,341]),
[iquote('0:UnC:488.0,341.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : PRO010+2 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 02:30:48 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.56
% 0.22/0.56 SPASS V 3.9
% 0.22/0.56 SPASS beiseite: Proof found.
% 0.22/0.56 % SZS status Theorem
% 0.22/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.56 SPASS derived 341 clauses, backtracked 68 clauses, performed 6 splits and kept 334 clauses.
% 0.22/0.56 SPASS allocated 99433 KBytes.
% 0.22/0.56 SPASS spent 0:00:00.18 on the problem.
% 0.22/0.56 0:00:00.04 for the input.
% 0.22/0.56 0:00:00.10 for the FLOTTER CNF translation.
% 0.22/0.56 0:00:00.00 for inferences.
% 0.22/0.56 0:00:00.00 for the backtracking.
% 0.22/0.56 0:00:00.01 for the reduction.
% 0.22/0.56
% 0.22/0.56
% 0.22/0.56 Here is a proof with depth 3, length 25 :
% 0.22/0.56 % SZS output start Refutation
% See solution above
% 0.22/0.56 Formulae used in the proof : goals sos_34 sos_15 sos_38 sos_32 sos_13 sos_26 sos_22
% 0.22/0.56
%------------------------------------------------------------------------------