TSTP Solution File: COL023-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL023-1 : TPTP v8.1.0. Released v1.0.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 : Fri Jul 15 00:42:25 EDT 2022
% Result : Unsatisfiable 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 7 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 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('COL023-1.p',unknown),
[] ).
cnf(2,axiom,
equal(apply(apply(apply(n,u),v),w),apply(apply(apply(u,w),v),w)),
file('COL023-1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(apply(combinator,u),u),
file('COL023-1.p',unknown),
[] ).
cnf(11,plain,
equal(apply(apply(apply(n,b),u),v),apply(v,apply(u,v))),
inference(spr,[status(thm),theory(equality)],[2,1]),
[iquote('0:SpR:2.0,1.0')] ).
cnf(23,plain,
equal(apply(apply(apply(n,apply(n,b)),u),v),apply(apply(u,apply(v,u)),v)),
inference(spr,[status(thm),theory(equality)],[11,2]),
[iquote('0:SpR:11.0,2.0')] ).
cnf(83,plain,
equal(apply(apply(apply(n,apply(n,b)),apply(b,u)),v),apply(u,apply(apply(v,apply(b,u)),v))),
inference(spr,[status(thm),theory(equality)],[23,1]),
[iquote('0:SpR:23.0,1.0')] ).
cnf(97,plain,
$false,
inference(unc,[status(thm)],[83,3]),
[iquote('0:UnC:83.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL023-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue May 31 15:36:51 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 76 clauses, backtracked 0 clauses, performed 0 splits and kept 53 clauses.
% 0.21/0.44 SPASS allocated 63357 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.21/0.44 0:00:00.03 for the input.
% 0.21/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.02 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 3, length 7 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : b_definition n_definition prove_fixed_point
% 0.21/0.44
%------------------------------------------------------------------------------