%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:49 EDT 2022
% Result : Theorem 0.10s 0.40s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 10 unt; 1 nHn; 22 RR)
% Number of literals : 41 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 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('PRO012+2.p',unknown),
[] ).
cnf(10,axiom,
occurrence_of(skf35(u),tptp3),
file('PRO012+2.p',unknown),
[] ).
cnf(34,axiom,
( occurrence_of(skf32(u),tptp1)
| occurrence_of(skf32(u),tptp2) ),
file('PRO012+2.p',unknown),
[] ).
cnf(35,axiom,
( ~ occurrence_of(u,tptp0)
| root_occ(skf35(u),u) ),
file('PRO012+2.p',unknown),
[] ).
cnf(55,axiom,
( ~ occurrence_of(u,tptp0)
| min_precedes(skf35(u),skf34(u),tptp0) ),
file('PRO012+2.p',unknown),
[] ).
cnf(56,axiom,
( ~ occurrence_of(u,tptp0)
| min_precedes(skf34(u),skf32(u),tptp0) ),
file('PRO012+2.p',unknown),
[] ).
cnf(72,axiom,
( ~ min_precedes(u,v,w)
| ~ min_precedes(x,u,w)
| min_precedes(x,v,w) ),
file('PRO012+2.p',unknown),
[] ).
cnf(81,axiom,
( ~ root_occ(u,skc1)
| ~ occurrence_of(u,tptp3)
| ~ occurrence_of(v,tptp2)
| ~ min_precedes(u,v,tptp0) ),
file('PRO012+2.p',unknown),
[] ).
cnf(82,axiom,
( ~ root_occ(u,skc1)
| ~ occurrence_of(u,tptp3)
| ~ occurrence_of(v,tptp1)
| ~ min_precedes(u,v,tptp0) ),
file('PRO012+2.p',unknown),
[] ).
cnf(98,plain,
min_precedes(skf35(skc1),skf34(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[6,55]),
[iquote('0:Res:6.0,55.0')] ).
cnf(99,plain,
min_precedes(skf34(skc1),skf32(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[6,56]),
[iquote('0:Res:6.0,56.0')] ).
cnf(100,plain,
root_occ(skf35(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,35]),
[iquote('0:Res:6.0,35.0')] ).
cnf(114,plain,
( ~ occurrence_of(u,tptp2)
| ~ occurrence_of(skf35(skc1),tptp3)
| ~ min_precedes(skf35(skc1),u,tptp0) ),
inference(res,[status(thm),theory(equality)],[100,81]),
[iquote('0:Res:100.0,81.2')] ).
cnf(117,plain,
( ~ occurrence_of(u,tptp1)
| ~ occurrence_of(skf35(skc1),tptp3)
| ~ min_precedes(skf35(skc1),u,tptp0) ),
inference(res,[status(thm),theory(equality)],[100,82]),
[iquote('0:Res:100.0,82.2')] ).
cnf(120,plain,
( ~ occurrence_of(u,tptp2)
| ~ min_precedes(skf35(skc1),u,tptp0) ),
inference(mrr,[status(thm)],[114,10]),
[iquote('0:MRR:114.1,10.0')] ).
cnf(122,plain,
( ~ occurrence_of(u,tptp1)
| ~ min_precedes(skf35(skc1),u,tptp0) ),
inference(mrr,[status(thm)],[117,10]),
[iquote('0:MRR:117.1,10.0')] ).
cnf(694,plain,
( ~ min_precedes(u,skf34(skc1),tptp0)
| min_precedes(u,skf32(skc1),tptp0) ),
inference(res,[status(thm),theory(equality)],[99,72]),
[iquote('0:Res:99.0,72.0')] ).
cnf(786,plain,
min_precedes(skf35(skc1),skf32(skc1),tptp0),
inference(res,[status(thm),theory(equality)],[98,694]),
[iquote('0:Res:98.0,694.0')] ).
cnf(799,plain,
~ occurrence_of(skf32(skc1),tptp1),
inference(res,[status(thm),theory(equality)],[786,122]),
[iquote('0:Res:786.0,122.1')] ).
cnf(800,plain,
~ occurrence_of(skf32(skc1),tptp2),
inference(res,[status(thm),theory(equality)],[786,120]),
[iquote('0:Res:786.0,120.1')] ).
cnf(829,plain,
occurrence_of(skf32(skc1),tptp2),
inference(res,[status(thm),theory(equality)],[34,799]),
[iquote('0:Res:34.0,799.0')] ).
cnf(830,plain,
$false,
inference(mrr,[status(thm)],[829,800]),
[iquote('0:MRR:829.0,800.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : PRO012+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.07 % Command : run_spass %d %s
% 0.06/0.25 % Computer : n018.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Mon Jun 13 03:21:12 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.10/0.40
% 0.10/0.40 SPASS V 3.9
% 0.10/0.40 SPASS beiseite: Proof found.
% 0.10/0.40 % SZS status Theorem
% 0.10/0.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.40 SPASS derived 658 clauses, backtracked 12 clauses, performed 1 splits and kept 445 clauses.
% 0.10/0.40 SPASS allocated 99157 KBytes.
% 0.10/0.40 SPASS spent 0:00:00.13 on the problem.
% 0.10/0.40 0:00:00.02 for the input.
% 0.10/0.40 0:00:00.05 for the FLOTTER CNF translation.
% 0.10/0.40 0:00:00.01 for inferences.
% 0.10/0.40 0:00:00.00 for the backtracking.
% 0.10/0.40 0:00:00.03 for the reduction.
% 0.10/0.40
% 0.10/0.40
% 0.10/0.40 Here is a proof with depth 5, length 22 :
% 0.10/0.40 % SZS output start Refutation
% See solution above
% 0.10/0.40 Formulae used in the proof : goals sos_32 sos
% 0.10/0.40
%------------------------------------------------------------------------------