TSTP Solution File: COL058-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL058-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 6 ( 0 equ; 4 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(response(response(lark,u),v),response(u,response(v,v))),
file('COL058-1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(response(u,u),u),
file('COL058-1.p',unknown),
[] ).
cnf(7,plain,
~ equal(response(response(lark,response(u,u)),u),response(u,u)),
inference(spl,[status(thm),theory(equality)],[1,2]),
[iquote('0:SpL:1.0,2.0')] ).
cnf(9,plain,
~ equal(response(response(response(lark,lark),u),u),response(u,u)),
inference(spl,[status(thm),theory(equality)],[1,7]),
[iquote('0:SpL:1.0,7.0')] ).
cnf(14,plain,
~ equal(response(response(response(lark,response(lark,lark)),u),response(u,u)),response(response(u,u),response(u,u))),
inference(spl,[status(thm),theory(equality)],[1,9]),
[iquote('0:SpL:1.0,9.0')] ).
cnf(17,plain,
$false,
inference(obv,[status(thm),theory(equality)],[14]),
[iquote('0:Obv:14.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL058-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n019.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 13:03:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41
% 0.19/0.41 SPASS V 3.9
% 0.19/0.41 SPASS beiseite: Proof found.
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 9 clauses.
% 0.19/0.41 SPASS allocated 63113 KBytes.
% 0.19/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.41 0:00:00.03 for the input.
% 0.19/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41 0:00:00.00 for inferences.
% 0.19/0.41 0:00:00.00 for the backtracking.
% 0.19/0.41 0:00:00.00 for the reduction.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Here is a proof with depth 3, length 6 :
% 0.19/0.41 % SZS output start Refutation
% See solution above
% 0.19/0.41 Formulae used in the proof : lark_exists prove_the_bird_exists
% 0.19/0.41
%------------------------------------------------------------------------------