TSTP Solution File: PRO011+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PRO011+1 : 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.45s 0.64s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 6 unt; 1 nHn; 19 RR)
% Number of literals : 35 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
occurrence_of(skc1,tptp0),
file('PRO011+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ occurrence_of(u,tptp0)
| leaf_occ(skf37(u),u) ),
file('PRO011+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ leaf(u,v)
| ~ min_precedes(u,w,v) ),
file('PRO011+1.p',unknown),
[] ).
cnf(51,axiom,
( ~ leaf_occ(u,v)
| occurrence_of(v,skf36(u,v)) ),
file('PRO011+1.p',unknown),
[] ).
cnf(52,axiom,
( ~ leaf_occ(u,v)
| leaf(u,skf36(u,w)) ),
file('PRO011+1.p',unknown),
[] ).
cnf(53,axiom,
( skP0(u,v,w)
| min_precedes(u,skf21(u,x),tptp0) ),
file('PRO011+1.p',unknown),
[] ).
cnf(63,axiom,
( ~ occurrence_of(u,v)
| ~ occurrence_of(u,w)
| equal(w,v) ),
file('PRO011+1.p',unknown),
[] ).
cnf(79,axiom,
( ~ leaf_occ(u,skc1)
| ~ skP0(v,skc1,u)
| min_precedes(v,skf20(v),tptp0) ),
file('PRO011+1.p',unknown),
[] ).
cnf(100,plain,
( ~ occurrence_of(skc1,u)
| equal(tptp0,u) ),
inference(res,[status(thm),theory(equality)],[6,63]),
[iquote('0:Res:6.0,63.0')] ).
cnf(108,plain,
leaf_occ(skf37(skc1),skc1),
inference(res,[status(thm),theory(equality)],[6,36]),
[iquote('0:Res:6.0,36.0')] ).
cnf(217,plain,
( ~ leaf_occ(u,skc1)
| equal(skf36(u,skc1),tptp0) ),
inference(res,[status(thm),theory(equality)],[51,100]),
[iquote('0:Res:51.1,100.0')] ).
cnf(224,plain,
leaf(skf37(skc1),skf36(skf37(skc1),u)),
inference(res,[status(thm),theory(equality)],[108,52]),
[iquote('0:Res:108.0,52.0')] ).
cnf(241,plain,
( ~ leaf_occ(skf37(skc1),skc1)
| leaf(skf37(skc1),tptp0) ),
inference(spr,[status(thm),theory(equality)],[217,224]),
[iquote('0:SpR:217.1,224.0')] ).
cnf(242,plain,
leaf(skf37(skc1),tptp0),
inference(mrr,[status(thm)],[241,108]),
[iquote('0:MRR:241.0,108.0')] ).
cnf(341,plain,
( ~ leaf(u,tptp0)
| skP0(u,v,w) ),
inference(res,[status(thm),theory(equality)],[53,45]),
[iquote('0:Res:53.1,45.1')] ).
cnf(753,plain,
( ~ leaf(u,tptp0)
| ~ leaf_occ(v,skc1)
| min_precedes(u,skf20(u),tptp0) ),
inference(res,[status(thm),theory(equality)],[341,79]),
[iquote('0:Res:341.1,79.1')] ).
cnf(756,plain,
( ~ leaf(u,tptp0)
| ~ leaf_occ(v,skc1) ),
inference(mrr,[status(thm)],[753,45]),
[iquote('0:MRR:753.2,45.1')] ).
cnf(760,plain,
~ leaf_occ(u,skc1),
inference(res,[status(thm),theory(equality)],[242,756]),
[iquote('0:Res:242.0,756.0')] ).
cnf(762,plain,
$false,
inference(unc,[status(thm)],[760,108]),
[iquote('0:UnC:760.0,108.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PRO011+1 : 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 01:03:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.64
% 0.45/0.64 SPASS V 3.9
% 0.45/0.64 SPASS beiseite: Proof found.
% 0.45/0.64 % SZS status Theorem
% 0.45/0.64 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.64 SPASS derived 603 clauses, backtracked 25 clauses, performed 3 splits and kept 419 clauses.
% 0.45/0.64 SPASS allocated 100145 KBytes.
% 0.45/0.64 SPASS spent 0:00:00.28 on the problem.
% 0.45/0.64 0:00:00.03 for the input.
% 0.45/0.64 0:00:00.15 for the FLOTTER CNF translation.
% 0.45/0.64 0:00:00.01 for inferences.
% 0.45/0.64 0:00:00.00 for the backtracking.
% 0.45/0.64 0:00:00.05 for the reduction.
% 0.45/0.64
% 0.45/0.64
% 0.45/0.64 Here is a proof with depth 4, length 19 :
% 0.45/0.64 % SZS output start Refutation
% See solution above
% 0.45/0.64 Formulae used in the proof : goals sos_35 sos_21 sos_34 sos_02
% 0.45/0.64
%------------------------------------------------------------------------------