%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO010+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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.38s 0.58s
% Output : Refutation 0.38s
% 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+3.p',unknown),
[] ).
cnf(8,axiom,
~ atomic(tptp0),
file('PRO010+3.p',unknown),
[] ).
cnf(9,axiom,
atomic(skf31(u,v)),
file('PRO010+3.p',unknown),
[] ).
cnf(35,axiom,
( skP0(u,v)
| min_precedes(u,skf22(u),tptp0) ),
file('PRO010+3.p',unknown),
[] ).
cnf(41,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf39(u),u) ),
file('PRO010+3.p',unknown),
[] ).
cnf(42,axiom,
( ~ arboreal(u)
| ~ occurrence_of(u,v)
| atomic(v) ),
file('PRO010+3.p',unknown),
[] ).
cnf(43,axiom,
( ~ atomic(u)
| ~ occurrence_of(v,u)
| arboreal(v) ),
file('PRO010+3.p',unknown),
[] ).
cnf(51,axiom,
( ~ atocc(u,v)
| occurrence_of(u,skf31(u,v)) ),
file('PRO010+3.p',unknown),
[] ).
cnf(60,axiom,
( ~ min_precedes(u,v,w)
| atocc(u,skf25(u,x)) ),
file('PRO010+3.p',unknown),
[] ).
cnf(66,axiom,
( ~ occurrence_of(u,v)
| ~ occurrence_of(u,w)
| equal(w,v) ),
file('PRO010+3.p',unknown),
[] ).
cnf(80,axiom,
( ~ skP0(u,v)
| ~ leaf_occ(v,skc1)
| min_precedes(u,skf21(u),tptp0) ),
file('PRO010+3.p',unknown),
[] ).
cnf(120,plain,
( ~ occurrence_of(skc1,u)
| equal(tptp0,u) ),
inference(res,[status(thm),theory(equality)],[6,66]),
[iquote('0:Res:6.0,66.0')] ).
cnf(122,plain,
( ~ arboreal(skc1)
| atomic(tptp0) ),
inference(res,[status(thm),theory(equality)],[6,42]),
[iquote('0:Res:6.0,42.1')] ).
cnf(128,plain,
leaf_occ(skf39(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,41]),
[iquote('0:Res:6.0,41.0')] ).
cnf(131,plain,
( ~ atomic(tptp0)
| arboreal(skc1) ),
inference(res,[status(thm),theory(equality)],[6,43]),
[iquote('0:Res:6.0,43.1')] ).
cnf(142,plain,
~ arboreal(skc1),
inference(mrr,[status(thm)],[122,8]),
[iquote('0:MRR:122.1,8.0')] ).
cnf(143,plain,
~ atomic(tptp0),
inference(mrr,[status(thm)],[131,142]),
[iquote('0:MRR:131.1,142.0')] ).
cnf(157,plain,
( ~ skP0(u,skf39(skc1))
| min_precedes(u,skf21(u),tptp0) ),
inference(res,[status(thm),theory(equality)],[128,80]),
[iquote('0:Res:128.0,80.1')] ).
cnf(330,plain,
( ~ atocc(skc1,u)
| equal(skf31(skc1,u),tptp0) ),
inference(res,[status(thm),theory(equality)],[51,120]),
[iquote('0:Res:51.1,120.0')] ).
cnf(350,plain,
( ~ atocc(skc1,u)
| atomic(tptp0) ),
inference(spr,[status(thm),theory(equality)],[330,9]),
[iquote('0:SpR:330.1,9.0')] ).
cnf(355,plain,
~ atocc(skc1,u),
inference(mrr,[status(thm)],[350,143]),
[iquote('0:MRR:350.1,143.0')] ).
cnf(441,plain,
( skP0(u,v)
| atocc(u,skf25(u,w)) ),
inference(res,[status(thm),theory(equality)],[35,60]),
[iquote('0:Res:35.1,60.0')] ).
cnf(454,plain,
( ~ skP0(u,skf39(skc1))
| atocc(u,skf25(u,v)) ),
inference(res,[status(thm),theory(equality)],[157,60]),
[iquote('0:Res:157.1,60.0')] ).
cnf(472,plain,
atocc(u,skf25(u,v)),
inference(mrr,[status(thm)],[454,441]),
[iquote('0:MRR:454.0,441.0')] ).
cnf(473,plain,
$false,
inference(unc,[status(thm)],[472,355]),
[iquote('0:UnC:472.0,355.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PRO010+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n014.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:58:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.38/0.58
% 0.38/0.58 SPASS V 3.9
% 0.38/0.58 SPASS beiseite: Proof found.
% 0.38/0.58 % SZS status Theorem
% 0.38/0.58 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.58 SPASS derived 308 clauses, backtracked 59 clauses, performed 7 splits and kept 355 clauses.
% 0.38/0.58 SPASS allocated 99952 KBytes.
% 0.38/0.58 SPASS spent 0:00:00.22 on the problem.
% 0.38/0.58 0:00:00.03 for the input.
% 0.38/0.58 0:00:00.11 for the FLOTTER CNF translation.
% 0.38/0.58 0:00:00.01 for inferences.
% 0.38/0.58 0:00:00.00 for the backtracking.
% 0.38/0.58 0:00:00.03 for the reduction.
% 0.38/0.58
% 0.38/0.58
% 0.38/0.58 Here is a proof with depth 3, length 25 :
% 0.38/0.58 % SZS output start Refutation
% See solution above
% 0.38/0.58 Formulae used in the proof : goals sos_51 sos_23 sos_55 sos_49 sos_07 sos_11 sos_02
% 0.38/0.58
%------------------------------------------------------------------------------