TSTP Solution File: SET835-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET835-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:04 EDT 2022
% Result : Unsatisfiable 0.43s 0.61s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_lessequals(v_Y,v_X,tc_set(t_a)),
file('SET835-1.p',unknown),
[] ).
cnf(3,axiom,
c_in(v_x,v_Y,t_a),
file('SET835-1.p',unknown),
[] ).
cnf(4,axiom,
~ c_in(v_x,v_X,t_a),
file('SET835-1.p',unknown),
[] ).
cnf(311,axiom,
( ~ c_in(u,v,w)
| ~ c_lessequals(v,x,tc_set(w))
| c_in(u,x,w) ),
file('SET835-1.p',unknown),
[] ).
cnf(1410,plain,
( ~ c_in(u,v_Y,t_a)
| c_in(u,v_X,t_a) ),
inference(res,[status(thm),theory(equality)],[1,311]),
[iquote('0:Res:1.0,311.1')] ).
cnf(1426,plain,
c_in(v_x,v_X,t_a),
inference(res,[status(thm),theory(equality)],[3,1410]),
[iquote('0:Res:3.0,1410.0')] ).
cnf(1444,plain,
$false,
inference(mrr,[status(thm)],[1426,4]),
[iquote('0:MRR:1426.0,4.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET835-1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n013.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 9 21:33:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.61
% 0.43/0.61 SPASS V 3.9
% 0.43/0.61 SPASS beiseite: Proof found.
% 0.43/0.61 % SZS status Theorem
% 0.43/0.61 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.43/0.61 SPASS derived 68 clauses, backtracked 0 clauses, performed 0 splits and kept 1371 clauses.
% 0.43/0.61 SPASS allocated 77787 KBytes.
% 0.43/0.61 SPASS spent 0:00:00.25 on the problem.
% 0.43/0.61 0:00:00.08 for the input.
% 0.43/0.61 0:00:00.00 for the FLOTTER CNF translation.
% 0.43/0.61 0:00:00.00 for inferences.
% 0.43/0.61 0:00:00.00 for the backtracking.
% 0.43/0.61 0:00:00.07 for the reduction.
% 0.43/0.61
% 0.43/0.61
% 0.43/0.61 Here is a proof with depth 2, length 7 :
% 0.43/0.61 % SZS output start Refutation
% See solution above
% 0.43/0.61 Formulae used in the proof : cls_conjecture_0 cls_conjecture_2 cls_conjecture_3 cls_Set_OsubsetD_0
% 0.43/0.61
%------------------------------------------------------------------------------