TSTP Solution File: COL118-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COL118-1 : TPTP v8.1.0. Released v3.2.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:42 EDT 2022
% Result : Unsatisfiable 0.50s 0.72s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_in(c_Pair(v_x,v_ya,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('COL118-1.p',unknown),
[] ).
cnf(2,axiom,
c_in(c_Pair(v_z,v_w,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('COL118-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),u,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),u,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('COL118-1.p',unknown),
[] ).
cnf(25,axiom,
c_in(c_Pair(u,u,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
file('COL118-1.p',unknown),
[] ).
cnf(28,axiom,
( ~ c_in(c_Pair(u,v,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| ~ c_in(c_Pair(w,x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(u,w),c_Comb_Ocomb_Oop_A_D_D(v,x),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
file('COL118-1.p',unknown),
[] ).
cnf(1437,plain,
( ~ c_in(c_Pair(u,v,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb))
| c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(u,v_z),c_Comb_Ocomb_Oop_A_D_D(v,v_w),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ),
inference(res,[status(thm),theory(equality)],[2,28]),
[iquote('0:Res:2.0,28.0')] ).
cnf(1481,plain,
~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(res,[status(thm),theory(equality)],[25,3]),
[iquote('0:Res:25.0,3.1')] ).
cnf(1486,plain,
c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_w),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)),
inference(res,[status(thm),theory(equality)],[1,1437]),
[iquote('0:Res:1.0,1437.0')] ).
cnf(1506,plain,
$false,
inference(mrr,[status(thm)],[1486,1481]),
[iquote('0:MRR:1486.0,1481.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL118-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 05:01:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.50/0.72
% 0.50/0.72 SPASS V 3.9
% 0.50/0.72 SPASS beiseite: Proof found.
% 0.50/0.72 % SZS status Theorem
% 0.50/0.72 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.50/0.72 SPASS derived 60 clauses, backtracked 0 clauses, performed 0 splits and kept 1406 clauses.
% 0.50/0.72 SPASS allocated 77895 KBytes.
% 0.50/0.72 SPASS spent 0:00:00.36 on the problem.
% 0.50/0.72 0:00:00.09 for the input.
% 0.50/0.72 0:00:00.00 for the FLOTTER CNF translation.
% 0.50/0.72 0:00:00.00 for inferences.
% 0.50/0.72 0:00:00.00 for the backtracking.
% 0.50/0.72 0:00:00.14 for the reduction.
% 0.50/0.72
% 0.50/0.72
% 0.50/0.72 Here is a proof with depth 2, length 9 :
% 0.50/0.72 % SZS output start Refutation
% See solution above
% 0.50/0.72 Formulae used in the proof : cls_conjecture_0 cls_conjecture_1 cls_conjecture_2 cls_Comb_Oparcontract_Ointros__1_0 cls_Comb_Oparcontract_Ointros__4_0
% 0.50/0.72
%------------------------------------------------------------------------------