TSTP Solution File: SCT131+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SCT131+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:37 EDT 2022
% Result : Theorem 6.22s 6.40s
% Output : Refutation 6.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 18 ( 18 usr; 12 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_Arrow__Order__Mirabelle_Ounanimity(v_F),
file('SCT131+1.p',unknown),
[] ).
cnf(133,axiom,
hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),v_Q____),c_Arrow__Order__Mirabelle_OProf)),
file('SCT131+1.p',unknown),
[] ).
cnf(235,axiom,
hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_Q____,u))),
file('SCT131+1.p',unknown),
[] ).
cnf(274,axiom,
~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_F,v_Q____))),
file('SCT131+1.p',unknown),
[] ).
cnf(733,axiom,
( ~ c_Arrow__Order__Mirabelle_Ounanimity(u)
| ~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v),w)),hAPP(x,skf118(x,w,v))))
| ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),x),c_Arrow__Order__Mirabelle_OProf))
| hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v),w)),hAPP(u,x))) ),
file('SCT131+1.p',unknown),
[] ).
cnf(816,plain,
( ~ c_Arrow__Order__Mirabelle_Ounanimity(v_F)
| ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),v_Q____),c_Arrow__Order__Mirabelle_OProf))
| ~ hBOOL(hAPP(hAPP(c_member(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),hAPP(hAPP(c_Product__Type_OPair(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_b____),v_b_H____)),hAPP(v_Q____,skf118(v_Q____,v_b_H____,v_b____)))) ),
inference(res,[status(thm),theory(equality)],[733,274]),
[iquote('0:Res:733.3,274.0')] ).
cnf(892,plain,
$false,
inference(mrr,[status(thm)],[816,1,133,235]),
[iquote('0:MRR:816.0,816.1,816.2,1.0,133.0,235.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SCT131+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 08:08:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 6.22/6.40
% 6.22/6.40 SPASS V 3.9
% 6.22/6.40 SPASS beiseite: Proof found.
% 6.22/6.40 % SZS status Theorem
% 6.22/6.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.22/6.40 SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 694 clauses.
% 6.22/6.40 SPASS allocated 131468 KBytes.
% 6.22/6.40 SPASS spent 0:00:06.02 on the problem.
% 6.22/6.40 0:00:00.05 for the input.
% 6.22/6.40 0:00:05.45 for the FLOTTER CNF translation.
% 6.22/6.40 0:00:00.00 for inferences.
% 6.22/6.40 0:00:00.00 for the backtracking.
% 6.22/6.40 0:00:00.33 for the reduction.
% 6.22/6.40
% 6.22/6.40
% 6.22/6.40 Here is a proof with depth 1, length 7 :
% 6.22/6.40 % SZS output start Refutation
% See solution above
% 6.22/6.40 Formulae used in the proof : fact_u fact__096Q_A_058_AProf_096 fact__096_B_Bi_O_Ab_A_060_092_060_094bsub_062Q_Ai_092_060_094esub_062_Ab_H_096 conj_0 fact_unanimity__def
% 6.22/6.40
%------------------------------------------------------------------------------