TSTP Solution File: PRO014+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:51 EDT 2022
% Result : Theorem 0.38s 0.56s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 34 ( 16 unt; 11 nHn; 34 RR)
% Number of literals : 90 ( 0 equ; 50 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
arboreal(skc3),
file('PRO014+2.p',unknown),
[] ).
cnf(7,axiom,
subactivity_occurrence(skc3,skc2),
file('PRO014+2.p',unknown),
[] ).
cnf(8,axiom,
occurrence_of(skc2,tptp0),
file('PRO014+2.p',unknown),
[] ).
cnf(11,axiom,
~ leaf_occ(skc3,skc2),
file('PRO014+2.p',unknown),
[] ).
cnf(13,axiom,
leaf(skf31(u),tptp0),
file('PRO014+2.p',unknown),
[] ).
cnf(36,axiom,
( ~ next_subocc(u,v,w)
| min_precedes(u,v,w) ),
file('PRO014+2.p',unknown),
[] ).
cnf(70,axiom,
( ~ min_precedes(u,v,w)
| ~ min_precedes(x,u,w)
| min_precedes(x,v,w) ),
file('PRO014+2.p',unknown),
[] ).
cnf(80,axiom,
( ~ arboreal(u)
| ~ subactivity_occurrence(u,v)
| ~ occurrence_of(v,tptp0)
| occurrence_of(skf33(w),tptp3)
| leaf_occ(u,v) ),
file('PRO014+2.p',unknown),
[] ).
cnf(82,axiom,
( ~ arboreal(u)
| ~ subactivity_occurrence(u,v)
| ~ occurrence_of(v,tptp0)
| leaf_occ(u,v)
| next_subocc(u,skf33(u),tptp0) ),
file('PRO014+2.p',unknown),
[] ).
cnf(83,axiom,
( ~ arboreal(u)
| ~ subactivity_occurrence(u,v)
| ~ occurrence_of(v,tptp0)
| leaf_occ(u,v)
| next_subocc(skf32(u),skf31(u),tptp0) ),
file('PRO014+2.p',unknown),
[] ).
cnf(84,axiom,
( ~ arboreal(u)
| ~ subactivity_occurrence(u,v)
| ~ occurrence_of(v,tptp0)
| leaf_occ(u,v)
| next_subocc(skf33(u),skf32(u),tptp0) ),
file('PRO014+2.p',unknown),
[] ).
cnf(85,axiom,
( ~ arboreal(u)
| ~ subactivity_occurrence(u,v)
| ~ occurrence_of(v,tptp0)
| leaf_occ(u,v)
| occurrence_of(skf31(u),tptp1)
| occurrence_of(skf31(u),tptp2) ),
file('PRO014+2.p',unknown),
[] ).
cnf(86,axiom,
( ~ leaf(u,tptp0)
| ~ occurrence_of(v,tptp3)
| ~ occurrence_of(u,tptp1)
| ~ min_precedes(v,u,tptp0)
| ~ next_subocc(skc3,v,tptp0) ),
file('PRO014+2.p',unknown),
[] ).
cnf(87,axiom,
( ~ leaf(u,tptp0)
| ~ occurrence_of(v,tptp3)
| ~ occurrence_of(u,tptp2)
| ~ min_precedes(v,u,tptp0)
| ~ next_subocc(skc3,v,tptp0) ),
file('PRO014+2.p',unknown),
[] ).
cnf(120,plain,
( ~ arboreal(skc3)
| ~ occurrence_of(skc2,tptp0)
| occurrence_of(skf31(skc3),tptp2)
| occurrence_of(skf31(skc3),tptp1)
| leaf_occ(skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[7,85]),
[iquote('0:Res:7.0,85.1')] ).
cnf(121,plain,
( ~ arboreal(skc3)
| ~ occurrence_of(skc2,tptp0)
| next_subocc(skf33(skc3),skf32(skc3),tptp0)
| leaf_occ(skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[7,84]),
[iquote('0:Res:7.0,84.1')] ).
cnf(122,plain,
( ~ arboreal(skc3)
| ~ occurrence_of(skc2,tptp0)
| next_subocc(skf32(skc3),skf31(skc3),tptp0)
| leaf_occ(skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[7,83]),
[iquote('0:Res:7.0,83.1')] ).
cnf(123,plain,
( ~ arboreal(skc3)
| ~ occurrence_of(skc2,tptp0)
| next_subocc(skc3,skf33(skc3),tptp0)
| leaf_occ(skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[7,82]),
[iquote('0:Res:7.0,82.1')] ).
cnf(124,plain,
( ~ arboreal(skc3)
| ~ occurrence_of(skc2,tptp0)
| occurrence_of(skf33(u),tptp3)
| leaf_occ(skc3,skc2) ),
inference(res,[status(thm),theory(equality)],[7,80]),
[iquote('0:Res:7.0,80.1')] ).
cnf(147,plain,
occurrence_of(skf33(u),tptp3),
inference(mrr,[status(thm)],[124,1,8,11]),
[iquote('0:MRR:124.0,124.1,124.3,1.0,8.0,11.0')] ).
cnf(149,plain,
next_subocc(skc3,skf33(skc3),tptp0),
inference(mrr,[status(thm)],[123,1,8,11]),
[iquote('0:MRR:123.0,123.1,123.3,1.0,8.0,11.0')] ).
cnf(150,plain,
next_subocc(skf33(skc3),skf32(skc3),tptp0),
inference(mrr,[status(thm)],[121,1,8,11]),
[iquote('0:MRR:121.0,121.1,121.3,1.0,8.0,11.0')] ).
cnf(151,plain,
next_subocc(skf32(skc3),skf31(skc3),tptp0),
inference(mrr,[status(thm)],[122,1,8,11]),
[iquote('0:MRR:122.0,122.1,122.3,1.0,8.0,11.0')] ).
cnf(152,plain,
( occurrence_of(skf31(skc3),tptp1)
| occurrence_of(skf31(skc3),tptp2) ),
inference(mrr,[status(thm)],[120,1,8,11]),
[iquote('0:MRR:120.0,120.1,120.4,1.0,8.0,11.0')] ).
cnf(285,plain,
min_precedes(skf32(skc3),skf31(skc3),tptp0),
inference(res,[status(thm),theory(equality)],[151,36]),
[iquote('0:Res:151.0,36.0')] ).
cnf(286,plain,
min_precedes(skf33(skc3),skf32(skc3),tptp0),
inference(res,[status(thm),theory(equality)],[150,36]),
[iquote('0:Res:150.0,36.0')] ).
cnf(697,plain,
( ~ min_precedes(u,skf32(skc3),tptp0)
| min_precedes(u,skf31(skc3),tptp0) ),
inference(res,[status(thm),theory(equality)],[285,70]),
[iquote('0:Res:285.0,70.0')] ).
cnf(1129,plain,
min_precedes(skf33(skc3),skf31(skc3),tptp0),
inference(res,[status(thm),theory(equality)],[286,697]),
[iquote('0:Res:286.0,697.0')] ).
cnf(1144,plain,
( ~ leaf(skf31(skc3),tptp0)
| ~ occurrence_of(skf33(skc3),tptp3)
| ~ occurrence_of(skf31(skc3),tptp1)
| ~ next_subocc(skc3,skf33(skc3),tptp0) ),
inference(res,[status(thm),theory(equality)],[1129,86]),
[iquote('0:Res:1129.0,86.3')] ).
cnf(1145,plain,
( ~ leaf(skf31(skc3),tptp0)
| ~ occurrence_of(skf33(skc3),tptp3)
| ~ occurrence_of(skf31(skc3),tptp2)
| ~ next_subocc(skc3,skf33(skc3),tptp0) ),
inference(res,[status(thm),theory(equality)],[1129,87]),
[iquote('0:Res:1129.0,87.3')] ).
cnf(1150,plain,
~ occurrence_of(skf31(skc3),tptp2),
inference(mrr,[status(thm)],[1145,13,147,149]),
[iquote('0:MRR:1145.0,1145.1,1145.3,13.0,147.0,149.0')] ).
cnf(1155,plain,
occurrence_of(skf31(skc3),tptp1),
inference(mrr,[status(thm)],[152,1150]),
[iquote('0:MRR:152.1,1150.0')] ).
cnf(1157,plain,
~ occurrence_of(skf31(skc3),tptp1),
inference(mrr,[status(thm)],[1144,13,147,149]),
[iquote('0:MRR:1144.0,1144.1,1144.3,13.0,147.0,149.0')] ).
cnf(1158,plain,
$false,
inference(mrr,[status(thm)],[1157,1155]),
[iquote('0:MRR:1157.0,1155.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 01:06:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.38/0.56
% 0.38/0.56 SPASS V 3.9
% 0.38/0.56 SPASS beiseite: Proof found.
% 0.38/0.56 % SZS status Theorem
% 0.38/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.56 SPASS derived 900 clauses, backtracked 15 clauses, performed 2 splits and kept 567 clauses.
% 0.38/0.56 SPASS allocated 99056 KBytes.
% 0.38/0.56 SPASS spent 0:00:00.21 on the problem.
% 0.38/0.56 0:00:00.04 for the input.
% 0.38/0.56 0:00:00.06 for the FLOTTER CNF translation.
% 0.38/0.56 0:00:00.01 for inferences.
% 0.38/0.56 0:00:00.00 for the backtracking.
% 0.38/0.56 0:00:00.06 for the reduction.
% 0.38/0.56
% 0.38/0.56
% 0.38/0.56 Here is a proof with depth 5, length 34 :
% 0.38/0.56 % SZS output start Refutation
% See solution above
% 0.38/0.56 Formulae used in the proof : goals sos_32 sos_04 sos
% 0.38/0.56
%------------------------------------------------------------------------------