%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL053-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:29 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 4 RR)
% Number of literals : 4 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(response(compose(u,v),w),response(u,response(v,w))),
file('COL053-1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(response(u,f(u)),response(a,response(b,response(c,f(u))))),
file('COL053-1.p',unknown),
[] ).
cnf(4,plain,
~ equal(response(u,response(v,f(compose(u,v)))),response(a,response(b,response(c,f(compose(u,v)))))),
inference(spl,[status(thm),theory(equality)],[1,2]),
[iquote('0:SpL:1.0,2.0')] ).
cnf(5,plain,
$false,
inference(unc,[status(thm)],[4,1]),
[iquote('0:UnC:4.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : COL053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n020.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 : Tue May 31 04:38:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 3 clauses.
% 0.20/0.41 SPASS allocated 63086 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.05 on the problem.
% 0.20/0.41 0:00:00.03 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 1, length 4 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : composer_exists prove_bird_exists
% 0.20/0.41
%------------------------------------------------------------------------------