TSTP Solution File: COL089-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL089-1 : TPTP v8.1.0. Released v2.7.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:36 EDT 2022
% Result : Unsatisfiable 25.25s 25.50s
% Output : Refutation 25.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 21 ( 8 unt; 0 nHn; 21 RR)
% Number of literals : 44 ( 0 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ member(comb_app(u,v),comb)
| member(u,comb) ),
file('COL089-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ member(u,comb)
| ~ member(v,comb)
| member(comb_app(v,u),comb) ),
file('COL089-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ member(u,comb)
| member(pair(u,u),rtrancl(contract)) ),
file('COL089-1.p',unknown),
[] ).
cnf(35,axiom,
( ~ member(u,comb)
| ~ member(pair(v,w),contract)
| ~ member(pair(comb_app(u,w),x),rtrancl(contract))
| member(pair(comb_app(u,v),x),rtrancl(contract)) ),
file('COL089-1.p',unknown),
[] ).
cnf(36,axiom,
trans(rtrancl(u)),
file('COL089-1.p',unknown),
[] ).
cnf(37,axiom,
( ~ trans(u)
| ~ member(pair(v,w),u)
| ~ member(pair(x,v),u)
| member(pair(x,w),u) ),
file('COL089-1.p',unknown),
[] ).
cnf(38,axiom,
( ~ member(pair(u,v),contract)
| member(v,comb) ),
file('COL089-1.p',unknown),
[] ).
cnf(39,axiom,
member(r,comb),
file('COL089-1.p',unknown),
[] ).
cnf(42,axiom,
member(pair(y__dfg,z__dfg),contract),
file('COL089-1.p',unknown),
[] ).
cnf(43,axiom,
member(pair(comb_app(r,p),comb_app(r,y__dfg)),rtrancl(contract)),
file('COL089-1.p',unknown),
[] ).
cnf(44,axiom,
~ member(pair(comb_app(r,p),comb_app(r,z__dfg)),rtrancl(contract)),
file('COL089-1.p',unknown),
[] ).
cnf(47,plain,
( ~ trans(rtrancl(contract))
| ~ member(pair(comb_app(r,p),u),rtrancl(contract))
| ~ member(pair(u,comb_app(r,z__dfg)),rtrancl(contract)) ),
inference(res,[status(thm),theory(equality)],[37,44]),
[iquote('0:Res:37.3,44.0')] ).
cnf(50,plain,
( ~ member(pair(u,comb_app(r,z__dfg)),rtrancl(contract))
| ~ member(pair(comb_app(r,p),u),rtrancl(contract)) ),
inference(mrr,[status(thm)],[47,36]),
[iquote('0:MRR:47.0,36.0')] ).
cnf(51,plain,
member(z__dfg,comb),
inference(res,[status(thm),theory(equality)],[42,38]),
[iquote('0:Res:42.0,38.0')] ).
cnf(327,plain,
( ~ member(comb_app(u,v),comb)
| ~ member(u,comb)
| ~ member(pair(w,v),contract)
| member(pair(comb_app(u,w),comb_app(u,v)),rtrancl(contract)) ),
inference(res,[status(thm),theory(equality)],[12,35]),
[iquote('0:Res:12.1,35.2')] ).
cnf(331,plain,
( ~ member(comb_app(u,v),comb)
| ~ member(pair(w,v),contract)
| member(pair(comb_app(u,w),comb_app(u,v)),rtrancl(contract)) ),
inference(mrr,[status(thm)],[327,7]),
[iquote('0:MRR:327.1,7.1')] ).
cnf(1501,plain,
( ~ member(comb_app(r,z__dfg),comb)
| ~ member(pair(u,z__dfg),contract)
| ~ member(pair(comb_app(r,p),comb_app(r,u)),rtrancl(contract)) ),
inference(res,[status(thm),theory(equality)],[331,50]),
[iquote('0:Res:331.2,50.0')] ).
cnf(14947,plain,
( ~ member(comb_app(r,z__dfg),comb)
| ~ member(pair(y__dfg,z__dfg),contract) ),
inference(res,[status(thm),theory(equality)],[43,1501]),
[iquote('0:Res:43.0,1501.2')] ).
cnf(14966,plain,
~ member(comb_app(r,z__dfg),comb),
inference(mrr,[status(thm)],[14947,42]),
[iquote('0:MRR:14947.1,42.0')] ).
cnf(14976,plain,
( ~ member(z__dfg,comb)
| ~ member(r,comb) ),
inference(res,[status(thm),theory(equality)],[11,14966]),
[iquote('0:Res:11.2,14966.0')] ).
cnf(14977,plain,
$false,
inference(mrr,[status(thm)],[14976,51,39]),
[iquote('0:MRR:14976.0,14976.1,51.0,39.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COL089-1 : TPTP v8.1.0. Released v2.7.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue May 31 08:28:55 EDT 2022
% 0.14/0.33 % CPUTime :
% 25.25/25.50
% 25.25/25.50 SPASS V 3.9
% 25.25/25.50 SPASS beiseite: Proof found.
% 25.25/25.50 % SZS status Theorem
% 25.25/25.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 25.25/25.50 SPASS derived 10558 clauses, backtracked 0 clauses, performed 0 splits and kept 6875 clauses.
% 25.25/25.50 SPASS allocated 97254 KBytes.
% 25.25/25.50 SPASS spent 0:0:24.85 on the problem.
% 25.25/25.50 0:00:00.03 for the input.
% 25.25/25.50 0:00:00.00 for the FLOTTER CNF translation.
% 25.25/25.50 0:00:00.35 for inferences.
% 25.25/25.50 0:00:00.00 for the backtracking.
% 25.25/25.50 0:0:24.32 for the reduction.
% 25.25/25.50
% 25.25/25.50
% 25.25/25.50 Here is a proof with depth 4, length 21 :
% 25.25/25.50 % SZS output start Refutation
% See solution above
% 25.25/25.50 Formulae used in the proof : ap_E1 comb_intros3 reduction_refl reduction_rls_4 trans_rtrancl transD contract_combD2 ap_reduce2_2h1 ap_reduce2_2h4 ap_reduce2_2h5 ap_reduce2_2c1
% 25.25/25.50
%------------------------------------------------------------------------------