%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SCT028-1 : TPTP v8.1.0. Released v4.1.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:06 EDT 2022
% Result : Unsatisfiable 2.09s 2.27s
% Output : Refutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 5 unt; 2 nHn; 10 RR)
% Number of literals : 16 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(438,axiom,
( equal(u,v)
| equal(v,u)
| c_in(c_Pair(u,v,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_Omkbot(w,u),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
file('SCT028-1.p',unknown),
[] ).
cnf(446,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_Arrow__Order__Mirabelle_Omkbot(u,v),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)) ),
file('SCT028-1.p',unknown),
[] ).
cnf(448,axiom,
c_in(v_sko__Arrow__Order__Mirabelle__Xlinear__alt__1,c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
file('SCT028-1.p',unknown),
[] ).
cnf(505,axiom,
~ equal(v_b,v_a),
file('SCT028-1.p',unknown),
[] ).
cnf(533,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)) ),
file('SCT028-1.p',unknown),
[] ).
cnf(545,plain,
( equal(u,v)
| c_in(c_Pair(v,u,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),c_Arrow__Order__Mirabelle_Omkbot(w,v),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
inference(obv,[status(thm),theory(equality)],[438]),
[iquote('0:Obv:438.0')] ).
cnf(9591,plain,
( ~ c_in(c_Arrow__Order__Mirabelle_Omkbot(u,v_a),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)],[545,533]),
[iquote('0:Res:545.1,533.1')] ).
cnf(9602,plain,
~ c_in(c_Arrow__Order__Mirabelle_Omkbot(u,v_a),c_Arrow__Order__Mirabelle_OLin,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_bool)),
inference(mrr,[status(thm)],[9591,505]),
[iquote('0:MRR:9591.1,505.0')] ).
cnf(9604,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)),
inference(res,[status(thm),theory(equality)],[446,9602]),
[iquote('0:Res:446.1,9602.0')] ).
cnf(9606,plain,
$false,
inference(unc,[status(thm)],[9604,448]),
[iquote('0:UnC:9604.0,448.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SCT028-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n004.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 05:47:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.09/2.27
% 2.09/2.27 SPASS V 3.9
% 2.09/2.27 SPASS beiseite: Proof found.
% 2.09/2.27 % SZS status Theorem
% 2.09/2.27 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.09/2.27 SPASS derived 7285 clauses, backtracked 0 clauses, performed 0 splits and kept 2472 clauses.
% 2.09/2.27 SPASS allocated 85283 KBytes.
% 2.09/2.27 SPASS spent 0:00:01.82 on the problem.
% 2.09/2.27 0:00:00.05 for the input.
% 2.09/2.27 0:00:00.00 for the FLOTTER CNF translation.
% 2.09/2.27 0:00:00.12 for inferences.
% 2.09/2.27 0:00:00.00 for the backtracking.
% 2.09/2.27 0:00:01.54 for the reduction.
% 2.09/2.27
% 2.09/2.27
% 2.09/2.27 Here is a proof with depth 2, length 10 :
% 2.09/2.27 % SZS output start Refutation
% See solution above
% 2.09/2.27 Formulae used in the proof : cls_in__mkbot_4 cls_mkbot__Lin_0 cls_linear__alt_0 cls_assms_0 cls_conjecture_0
% 2.09/2.27
%------------------------------------------------------------------------------