TSTP Solution File: SET846-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET846-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 : Tue Jul 19 05:29:12 EDT 2022
% Result : Unsatisfiable 1.15s 1.33s
% Output : Refutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 12 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ c_in(u,v,tc_set(w))
| c_lessequals(u,c_Union(v,w),tc_set(w)) ),
file('SET846-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ c_in(u,c_Zorn_OTFin(v,w),tc_set(tc_set(w)))
| c_in(c_Zorn_Osucc(v,u,w),c_Zorn_OTFin(v,w),tc_set(tc_set(w))) ),
file('SET846-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ c_lessequals(u,c_Zorn_OTFin(v,w),tc_set(tc_set(tc_set(w))))
| c_in(c_Union(u,tc_set(w)),c_Zorn_OTFin(v,w),tc_set(tc_set(w))) ),
file('SET846-1.p',unknown),
[] ).
cnf(9,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(t_a))),
file('SET846-1.p',unknown),
[] ).
cnf(319,axiom,
c_lessequals(u,u,tc_set(v)),
file('SET846-1.p',unknown),
[] ).
cnf(1401,plain,
~ c_in(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(res,[status(thm),theory(equality)],[3,9]),
[iquote('0:Res:3.1,9.0')] ).
cnf(3258,plain,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(res,[status(thm),theory(equality)],[5,1401]),
[iquote('0:Res:5.1,1401.0')] ).
cnf(3418,plain,
~ c_lessequals(c_Zorn_OTFin(v_S,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))),
inference(res,[status(thm),theory(equality)],[6,3258]),
[iquote('0:Res:6.1,3258.0')] ).
cnf(3421,plain,
$false,
inference(mrr,[status(thm)],[3418,319]),
[iquote('0:MRR:3418.0,319.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET846-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 21:17:33 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.15/1.33
% 1.15/1.33 SPASS V 3.9
% 1.15/1.33 SPASS beiseite: Proof found.
% 1.15/1.33 % SZS status Theorem
% 1.15/1.33 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.15/1.33 SPASS derived 1750 clauses, backtracked 0 clauses, performed 1 splits and kept 2192 clauses.
% 1.15/1.33 SPASS allocated 80397 KBytes.
% 1.15/1.33 SPASS spent 0:00:00.94 on the problem.
% 1.15/1.33 0:00:00.09 for the input.
% 1.15/1.33 0:00:00.00 for the FLOTTER CNF translation.
% 1.15/1.33 0:00:00.07 for inferences.
% 1.15/1.33 0:00:00.00 for the backtracking.
% 1.15/1.33 0:00:00.54 for the reduction.
% 1.15/1.33
% 1.15/1.33
% 1.15/1.33 Here is a proof with depth 3, length 9 :
% 1.15/1.33 % SZS output start Refutation
% See solution above
% 1.15/1.33 Formulae used in the proof : cls_Set_OUnion__upper_0 cls_Zorn_OTFin_OsuccI_0 cls_Zorn_OTFin__UnionI_0 cls_conjecture_1 cls_Set_Osubset__refl_0
% 1.15/1.33
%------------------------------------------------------------------------------