%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:46 EDT 2022
% Result : Theorem 0.18s 0.55s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 25 ( 13 unt; 1 nHn; 25 RR)
% Number of literals : 48 ( 0 equ; 28 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
occurrence_of(skc1,tptp0),
file('PRO009+2.p',unknown),
[] ).
cnf(10,axiom,
occurrence_of(skf33(u),tptp3),
file('PRO009+2.p',unknown),
[] ).
cnf(34,axiom,
( occurrence_of(skf31(u),tptp1)
| occurrence_of(skf31(u),tptp2) ),
file('PRO009+2.p',unknown),
[] ).
cnf(35,axiom,
( ~ occurrence_of(u,tptp0)
| root_occ(skf33(u),u) ),
file('PRO009+2.p',unknown),
[] ).
cnf(36,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf31(u),u) ),
file('PRO009+2.p',unknown),
[] ).
cnf(37,axiom,
( ~ next_subocc(u,v,w)
| min_precedes(u,v,w) ),
file('PRO009+2.p',unknown),
[] ).
cnf(56,axiom,
( ~ occurrence_of(u,tptp0)
| next_subocc(skf33(u),skf32(u),tptp0) ),
file('PRO009+2.p',unknown),
[] ).
cnf(57,axiom,
( ~ occurrence_of(u,tptp0)
| next_subocc(skf32(u),skf31(u),tptp0) ),
file('PRO009+2.p',unknown),
[] ).
cnf(73,axiom,
( ~ min_precedes(u,v,w)
| ~ min_precedes(x,u,w)
| min_precedes(x,v,w) ),
file('PRO009+2.p',unknown),
[] ).
cnf(83,axiom,
( ~ leaf_occ(u,skc1)
| ~ root_occ(v,skc1)
| ~ occurrence_of(v,tptp3)
| ~ occurrence_of(u,tptp1)
| ~ min_precedes(v,u,tptp0) ),
file('PRO009+2.p',unknown),
[] ).
cnf(84,axiom,
( ~ leaf_occ(u,skc1)
| ~ root_occ(v,skc1)
| ~ occurrence_of(v,tptp3)
| ~ occurrence_of(u,tptp2)
| ~ min_precedes(v,u,tptp0) ),
file('PRO009+2.p',unknown),
[] ).
cnf(97,plain,
next_subocc(skf33(skc1),skf32(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[6,56]),
[iquote('0:Res:6.0,56.0')] ).
cnf(98,plain,
next_subocc(skf32(skc1),skf31(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[6,57]),
[iquote('0:Res:6.0,57.0')] ).
cnf(99,plain,
root_occ(skf33(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,35]),
[iquote('0:Res:6.0,35.0')] ).
cnf(100,plain,
leaf_occ(skf31(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,36]),
[iquote('0:Res:6.0,36.0')] ).
cnf(228,plain,
min_precedes(skf32(skc1),skf31(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[98,37]),
[iquote('0:Res:98.0,37.0')] ).
cnf(229,plain,
min_precedes(skf33(skc1),skf32(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[97,37]),
[iquote('0:Res:97.0,37.0')] ).
cnf(706,plain,
( ~ min_precedes(u,skf32(skc1),tptp0)
| min_precedes(u,skf31(skc1),tptp0) ),
inference(res,[status(thm),theory(equality)],[228,73]),
[iquote('0:Res:228.0,73.0')] ).
cnf(796,plain,
min_precedes(skf33(skc1),skf31(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[229,706]),
[iquote('0:Res:229.0,706.0')] ).
cnf(890,plain,
( ~ leaf_occ(skf31(skc1),skc1)
| ~ root_occ(skf33(skc1),skc1)
| ~ occurrence_of(skf33(skc1),tptp3)
| ~ occurrence_of(skf31(skc1),tptp2) ),
inference(res,[status(thm),theory(equality)],[796,84]),
[iquote('0:Res:796.0,84.4')] ).
cnf(896,plain,
~ occurrence_of(skf31(skc1),tptp2),
inference(mrr,[status(thm)],[890,100,99,10]),
[iquote('0:MRR:890.0,890.1,890.2,100.0,99.0,10.0')] ).
cnf(938,plain,
( ~ leaf_occ(skf31(skc1),skc1)
| ~ root_occ(skf33(skc1),skc1)
| ~ occurrence_of(skf33(skc1),tptp3)
| ~ occurrence_of(skf31(skc1),tptp1) ),
inference(res,[status(thm),theory(equality)],[796,83]),
[iquote('0:Res:796.0,83.4')] ).
cnf(941,plain,
~ occurrence_of(skf31(skc1),tptp1),
inference(mrr,[status(thm)],[938,100,99,10]),
[iquote('0:MRR:938.0,938.1,938.2,100.0,99.0,10.0')] ).
cnf(942,plain,
occurrence_of(skf31(skc1),tptp2),
inference(res,[status(thm),theory(equality)],[34,941]),
[iquote('0:Res:34.0,941.0')] ).
cnf(943,plain,
$false,
inference(mrr,[status(thm)],[942,896]),
[iquote('0:MRR:942.0,896.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : PRO009+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 03:21:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.55
% 0.18/0.55 SPASS V 3.9
% 0.18/0.55 SPASS beiseite: Proof found.
% 0.18/0.55 % SZS status Theorem
% 0.18/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.55 SPASS derived 765 clauses, backtracked 14 clauses, performed 1 splits and kept 495 clauses.
% 0.18/0.55 SPASS allocated 99144 KBytes.
% 0.18/0.55 SPASS spent 0:00:00.20 on the problem.
% 0.18/0.55 0:00:00.04 for the input.
% 0.18/0.55 0:00:00.09 for the FLOTTER CNF translation.
% 0.18/0.55 0:00:00.01 for inferences.
% 0.18/0.55 0:00:00.00 for the backtracking.
% 0.18/0.55 0:00:00.04 for the reduction.
% 0.18/0.55
% 0.18/0.55
% 0.18/0.55 Here is a proof with depth 6, length 25 :
% 0.18/0.55 % SZS output start Refutation
% See solution above
% 0.18/0.55 Formulae used in the proof : goals sos_32 sos_04 sos
% 0.18/0.55
%------------------------------------------------------------------------------