TSTP Solution File: COL056-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL056-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:30 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 7 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 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(response(compose(u,v),w),response(u,response(v,w))),
file('COL056-1.p',unknown),
[] ).
cnf(2,axiom,
equal(response(a,b),c),
file('COL056-1.p',unknown),
[] ).
cnf(3,axiom,
equal(response(a,c),b),
file('COL056-1.p',unknown),
[] ).
cnf(4,axiom,
~ equal(response(u,v),v),
file('COL056-1.p',unknown),
[] ).
cnf(10,plain,
~ equal(response(u,response(v,w)),w),
inference(spl,[status(thm),theory(equality)],[1,4]),
[iquote('0:SpL:1.0,4.0')] ).
cnf(11,plain,
~ equal(response(u,b),c),
inference(spl,[status(thm),theory(equality)],[3,10]),
[iquote('0:SpL:3.0,10.0')] ).
cnf(15,plain,
$false,
inference(unc,[status(thm)],[11,2]),
[iquote('0:UnC:11.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL056-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 12:08:11 EDT 2022
% 0.12/0.34 % 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/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.20/0.41 SPASS allocated 63091 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 2, length 7 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : composer_exists a_to_b_responds_c a_to_c_responds_b prove_there_exists_a_happy_bird
% 0.20/0.41
%------------------------------------------------------------------------------