TSTP Solution File: SCT073-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SCT073-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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 : Mon Jul 18 22:13:20 EDT 2022
% Result : Unsatisfiable 3.81s 3.99s
% Output : Refutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 5 unt; 4 nHn; 15 RR)
% Number of literals : 26 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(116,axiom,
( ~ c_in(u,v,w)
| equal(c_Set_Oinsert(u,v,w),v) ),
file('SCT073-1.p',unknown),
[] ).
cnf(188,axiom,
hBOOL(hAPP(c_Set_Oinsert(u,v,w),u)),
file('SCT073-1.p',unknown),
[] ).
cnf(459,axiom,
( equal(u,v)
| c_in(c_Pair(u,v,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(u,v),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('SCT073-1.p',unknown),
[] ).
cnf(460,axiom,
( equal(u,v)
| c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(u,v),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
file('SCT073-1.p',unknown),
[] ).
cnf(523,axiom,
( ~ hBOOL(hAPP(u,v))
| c_in(v,u,w) ),
file('SCT073-1.p',unknown),
[] ).
cnf(525,axiom,
( ~ c_in(u,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),u,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
| v_thesis____ ),
file('SCT073-1.p',unknown),
[] ).
cnf(527,axiom,
~ equal(v_b____,v_a____),
file('SCT073-1.p',unknown),
[] ).
cnf(549,axiom,
~ v_thesis____,
file('SCT073-1.p',unknown),
[] ).
cnf(559,plain,
( ~ c_in(u,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| ~ c_in(c_Pair(v_a____,v_b____,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),u,tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(mrr,[status(thm)],[525,549]),
[iquote('0:MRR:525.2,549.0')] ).
cnf(615,plain,
c_in(u,c_Set_Oinsert(u,v,w),x),
inference(res,[status(thm),theory(equality)],[188,523]),
[iquote('0:Res:188.0,523.0')] ).
cnf(707,plain,
( ~ c_in(u,v,w)
| c_in(u,v,x) ),
inference(spr,[status(thm),theory(equality)],[116,615]),
[iquote('0:SpR:116.1,615.0')] ).
cnf(1124,plain,
( equal(u,v)
| c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(u,v),c_Arrow__Order__Mirabelle_OLin,w) ),
inference(res,[status(thm),theory(equality)],[460,707]),
[iquote('0:Res:460.1,707.0')] ).
cnf(1914,plain,
( equal(u,v)
| c_in(c_Pair(u,v,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(u,v),w) ),
inference(res,[status(thm),theory(equality)],[459,707]),
[iquote('0:Res:459.1,707.0')] ).
cnf(13003,plain,
( ~ c_in(v_sko__Arrow__Order__Mirabelle__Xcomplete__Lin__1(v_a____,v_b____),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool))
| equal(v_b____,v_a____) ),
inference(res,[status(thm),theory(equality)],[1914,559]),
[iquote('0:Res:1914.1,559.1')] ).
cnf(13034,plain,
$false,
inference(mrr,[status(thm)],[13003,1124,527]),
[iquote('0:MRR:13003.0,13003.1,1124.1,527.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SCT073-1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n014.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 : Sat Jul 2 03:35:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.81/3.99
% 3.81/3.99 SPASS V 3.9
% 3.81/3.99 SPASS beiseite: Proof found.
% 3.81/3.99 % SZS status Theorem
% 3.81/3.99 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.81/3.99 SPASS derived 10532 clauses, backtracked 0 clauses, performed 0 splits and kept 4077 clauses.
% 3.81/3.99 SPASS allocated 89463 KBytes.
% 3.81/3.99 SPASS spent 0:00:03.52 on the problem.
% 3.81/3.99 0:00:00.05 for the input.
% 3.81/3.99 0:00:00.00 for the FLOTTER CNF translation.
% 3.81/3.99 0:00:00.16 for inferences.
% 3.81/3.99 0:00:00.00 for the backtracking.
% 3.81/3.99 0:00:03.16 for the reduction.
% 3.81/3.99
% 3.81/3.99
% 3.81/3.99 Here is a proof with depth 4, length 15 :
% 3.81/3.99 % SZS output start Refutation
% See solution above
% 3.81/3.99 Formulae used in the proof : cls_insert__absorb_0 cls_insert__code_1 cls_complete__Lin_1 cls_complete__Lin_0 cls_mem__def_1 cls_that_0 cls_CHAINED_0 cls_conjecture_0
% 3.81/3.99
%------------------------------------------------------------------------------