%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : ALG179+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:02:49 EDT 2022
% Result : Theorem 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 4 unt; 0 nHn; 19 RR)
% Number of literals : 53 ( 0 equ; 37 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
sorti2(skc3),
file('ALG179+1.p',unknown),
[] ).
cnf(2,axiom,
sorti2(skc2),
file('ALG179+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ sorti2(u)
| sorti1(j(u)) ),
file('ALG179+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ sorti2(u)
| equal(h(j(u)),u) ),
file('ALG179+1.p',unknown),
[] ).
cnf(7,axiom,
~ equal(op2(op2(skc2,skc3),skc3),skc2),
file('ALG179+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ sorti2(u)
| ~ sorti2(v)
| sorti2(op2(v,u)) ),
file('ALG179+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ sorti1(u)
| ~ sorti1(v)
| equal(op1(op1(v,u),u),v) ),
file('ALG179+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ sorti1(u)
| ~ sorti1(v)
| equal(op2(h(v),h(u)),h(op1(v,u))) ),
file('ALG179+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ sorti2(u)
| ~ sorti2(v)
| equal(op1(j(v),j(u)),j(op2(v,u))) ),
file('ALG179+1.p',unknown),
[] ).
cnf(29,plain,
( ~ sorti2(u)
| ~ sorti2(v)
| ~ sorti1(j(u))
| ~ sorti1(j(v))
| equal(op1(j(op2(v,u)),j(u)),j(v)) ),
inference(spr,[status(thm),theory(equality)],[12,10]),
[iquote('0:SpR:12.2,10.2')] ).
cnf(36,plain,
( ~ sorti2(u)
| ~ sorti2(v)
| equal(op1(j(op2(v,u)),j(u)),j(v)) ),
inference(ssi,[status(thm)],[29,4]),
[iquote('0:SSi:29.3,29.2,4.1,4.1')] ).
cnf(41,plain,
( ~ sorti2(u)
| ~ sorti1(v)
| ~ sorti1(j(u))
| equal(h(op1(j(u),v)),op2(u,h(v))) ),
inference(spr,[status(thm),theory(equality)],[5,11]),
[iquote('0:SpR:5.1,11.2')] ).
cnf(43,plain,
( ~ sorti2(u)
| ~ sorti1(v)
| equal(h(op1(j(u),v)),op2(u,h(v))) ),
inference(ssi,[status(thm)],[41,4]),
[iquote('0:SSi:41.2,4.1')] ).
cnf(208,plain,
( ~ sorti2(u)
| ~ sorti2(v)
| ~ sorti2(op2(v,u))
| ~ sorti1(j(u))
| equal(op2(op2(v,u),h(j(u))),h(j(v))) ),
inference(spr,[status(thm),theory(equality)],[36,43]),
[iquote('0:SpR:36.2,43.2')] ).
cnf(217,plain,
( ~ sorti2(u)
| ~ sorti2(v)
| ~ sorti2(op2(v,u))
| ~ sorti1(j(u))
| equal(op2(op2(v,u),u),v) ),
inference(rew,[status(thm),theory(equality)],[5,208]),
[iquote('0:Rew:5.1,208.4,5.1,208.4')] ).
cnf(218,plain,
( ~ sorti2(u)
| ~ sorti2(v)
| equal(op2(op2(v,u),u),v) ),
inference(ssi,[status(thm)],[217,4,9]),
[iquote('0:SSi:217.3,217.2,4.2,9.1')] ).
cnf(237,plain,
( ~ sorti2(skc3)
| ~ sorti2(skc2)
| ~ equal(skc2,skc2) ),
inference(spl,[status(thm),theory(equality)],[218,7]),
[iquote('0:SpL:218.2,7.0')] ).
cnf(238,plain,
( ~ sorti2(skc3)
| ~ sorti2(skc2) ),
inference(obv,[status(thm),theory(equality)],[237]),
[iquote('0:Obv:237.2')] ).
cnf(239,plain,
$false,
inference(ssi,[status(thm)],[238,2,1]),
[iquote('0:SSi:238.1,238.0,2.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG179+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n027.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 : Tue Jun 7 23:52:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 132 clauses, backtracked 0 clauses, performed 0 splits and kept 58 clauses.
% 0.18/0.45 SPASS allocated 104151 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.45 0:00:00.03 for the input.
% 0.18/0.45 0:00:00.02 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.02 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 3, length 19 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : ax4 co1 ax2 ax3
% 0.18/0.45
%------------------------------------------------------------------------------