TSTP Solution File: COL041-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL041-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 : Fri Jul 15 00:42:27 EDT 2022
% Result : Unsatisfiable 0.47s 0.67s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(apply(apply(apply(b,u),v),w),apply(u,apply(v,w))),
file('COL041-1.p',unknown),
[] ).
cnf(2,axiom,
equal(apply(m,u),apply(u,u)),
file('COL041-1.p',unknown),
[] ).
cnf(3,axiom,
equal(apply(apply(apply(c,u),v),w),apply(apply(u,w),v)),
file('COL041-1.p',unknown),
[] ).
cnf(4,axiom,
~ equal(apply(f(u),apply(u,f(u))),apply(u,f(u))),
file('COL041-1.p',unknown),
[] ).
cnf(18,plain,
equal(apply(u,apply(v,apply(apply(b,u),v))),apply(m,apply(apply(b,u),v))),
inference(spr,[status(thm),theory(equality)],[1,2]),
[iquote('0:SpR:1.0,2.0')] ).
cnf(21,plain,
~ equal(apply(f(apply(apply(b,u),v)),apply(u,apply(v,f(apply(apply(b,u),v))))),apply(u,apply(v,f(apply(apply(b,u),v))))),
inference(spl,[status(thm),theory(equality)],[1,4]),
[iquote('0:SpL:1.0,4.0')] ).
cnf(897,plain,
~ equal(apply(f(apply(apply(b,u),apply(apply(c,v),w))),apply(u,apply(apply(v,f(apply(apply(b,u),apply(apply(c,v),w)))),w))),apply(u,apply(apply(v,f(apply(apply(b,u),apply(apply(c,v),w)))),w))),
inference(spl,[status(thm),theory(equality)],[3,21]),
[iquote('0:SpL:3.0,21.0')] ).
cnf(922,plain,
$false,
inference(unc,[status(thm)],[897,18]),
[iquote('0:UnC:897.0,18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COL041-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 May 31 08:37:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.47/0.67
% 0.47/0.67 SPASS V 3.9
% 0.47/0.67 SPASS beiseite: Proof found.
% 0.47/0.67 % SZS status Theorem
% 0.47/0.67 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.67 SPASS derived 647 clauses, backtracked 0 clauses, performed 0 splits and kept 359 clauses.
% 0.47/0.67 SPASS allocated 65294 KBytes.
% 0.47/0.67 SPASS spent 0:00:00.32 on the problem.
% 0.47/0.67 0:00:00.03 for the input.
% 0.47/0.67 0:00:00.00 for the FLOTTER CNF translation.
% 0.47/0.67 0:00:00.02 for inferences.
% 0.47/0.67 0:00:00.00 for the backtracking.
% 0.47/0.67 0:00:00.24 for the reduction.
% 0.47/0.67
% 0.47/0.67
% 0.47/0.67 Here is a proof with depth 2, length 8 :
% 0.47/0.67 % SZS output start Refutation
% See solution above
% 0.47/0.67 Formulae used in the proof : b_definition m_definition c_definition prove_fixed_point
% 0.47/0.67
%------------------------------------------------------------------------------