TSTP Solution File: PUZ063-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PUZ063-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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 18:27:26 EDT 2022
% Result : Unsatisfiable 0.92s 1.12s
% Output : Refutation 0.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 5 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 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; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file('PUZ063-1.p',unknown),
[] ).
cnf(8,axiom,
~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
file('PUZ063-1.p',unknown),
[] ).
cnf(1487,axiom,
equal(c_union(c_emptyset,u,v),u),
file('PUZ063-1.p',unknown),
[] ).
cnf(2774,plain,
~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
inference(rew,[status(thm),theory(equality)],[1487,8]),
[iquote('0:Rew:1487.0,8.0')] ).
cnf(2775,plain,
$false,
inference(mrr,[status(thm)],[2774,6]),
[iquote('0:MRR:2774.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ063-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.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 : Sun May 29 00:43:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.92/1.12
% 0.92/1.12 SPASS V 3.9
% 0.92/1.12 SPASS beiseite: Proof found.
% 0.92/1.12 % SZS status Theorem
% 0.92/1.12 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.92/1.12 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 1554 clauses.
% 0.92/1.12 SPASS allocated 79775 KBytes.
% 0.92/1.12 SPASS spent 0:00:00.72 on the problem.
% 0.92/1.12 0:00:00.21 for the input.
% 0.92/1.12 0:00:00.00 for the FLOTTER CNF translation.
% 0.92/1.12 0:00:00.00 for inferences.
% 0.92/1.12 0:00:00.00 for the backtracking.
% 0.92/1.12 0:00:00.20 for the reduction.
% 0.92/1.12
% 0.92/1.12
% 0.92/1.12 Here is a proof with depth 0, length 5 :
% 0.92/1.12 % SZS output start Refutation
% See solution above
% 0.92/1.12 Formulae used in the proof : cls_conjecture_0 cls_conjecture_2 cls_Set_OUn__empty__left_0
% 0.92/1.12
%------------------------------------------------------------------------------