TSTP Solution File: ALG019+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG019+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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 : Thu Jul 14 18:01:59 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 4 unt; 0 nHn; 18 RR)
% Number of literals : 39 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
sorti2(skc1),
file('ALG019+1.p',unknown),
[] ).
cnf(2,axiom,
sorti1(skf1(u)),
file('ALG019+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ sorti1(u)
| sorti2(h(u)) ),
file('ALG019+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ sorti2(u)
| sorti1(j(u)) ),
file('ALG019+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ sorti1(u)
| equal(j(h(u)),u) ),
file('ALG019+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ sorti2(u)
| equal(op2(u,u),skc1) ),
file('ALG019+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ sorti1(u)
| ~ sorti1(v)
| sorti1(op1(v,u)) ),
file('ALG019+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ sorti1(u)
| ~ equal(op1(skf1(u),skf1(u)),u) ),
file('ALG019+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ sorti1(u)
| ~ sorti1(v)
| equal(op2(h(v),h(u)),h(op1(v,u))) ),
file('ALG019+1.p',unknown),
[] ).
cnf(41,plain,
( ~ sorti1(u)
| ~ sorti1(u)
| ~ sorti2(h(u))
| equal(h(op1(u,u)),skc1) ),
inference(spr,[status(thm),theory(equality)],[11,7]),
[iquote('0:SpR:11.2,7.1')] ).
cnf(47,plain,
( ~ sorti1(u)
| ~ sorti2(h(u))
| equal(h(op1(u,u)),skc1) ),
inference(obv,[status(thm),theory(equality)],[41]),
[iquote('0:Obv:41.0')] ).
cnf(48,plain,
( ~ sorti1(u)
| equal(h(op1(u,u)),skc1) ),
inference(ssi,[status(thm)],[47,3]),
[iquote('0:SSi:47.1,3.1')] ).
cnf(54,plain,
( ~ sorti1(u)
| ~ sorti1(op1(u,u))
| equal(op1(u,u),j(skc1)) ),
inference(spr,[status(thm),theory(equality)],[48,6]),
[iquote('0:SpR:48.1,6.1')] ).
cnf(59,plain,
( ~ sorti1(u)
| equal(op1(u,u),j(skc1)) ),
inference(ssi,[status(thm)],[54,8]),
[iquote('0:SSi:54.1,8.2')] ).
cnf(83,plain,
( ~ sorti1(skf1(u))
| ~ sorti1(u)
| ~ equal(j(skc1),u) ),
inference(spl,[status(thm),theory(equality)],[59,10]),
[iquote('0:SpL:59.1,10.1')] ).
cnf(85,plain,
( ~ sorti1(u)
| ~ equal(j(skc1),u) ),
inference(ssi,[status(thm)],[83,2]),
[iquote('0:SSi:83.0,2.0')] ).
cnf(93,plain,
~ sorti1(j(skc1)),
inference(eqr,[status(thm),theory(equality)],[85]),
[iquote('0:EqR:85.1')] ).
cnf(94,plain,
$false,
inference(ssi,[status(thm)],[93,4,1]),
[iquote('0:SSi:93.0,4.0,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG019+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 8 20:29:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 47 clauses, backtracked 0 clauses, performed 0 splits and kept 30 clauses.
% 0.20/0.45 SPASS allocated 103917 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.45 0:00:00.03 for the input.
% 0.20/0.45 0:00:00.02 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.00 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 4, length 18 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : ax4 ax3 co1 ax1
% 0.20/0.45
%------------------------------------------------------------------------------