TSTP Solution File: LAT262-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT262-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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 : Sun Jul 17 06:49:51 EDT 2022
% Result : Unsatisfiable 0.91s 1.15s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),v_A),
file('LAT262-1.p',unknown),
[] ).
cnf(10,axiom,
equal(c_Tarski_Opotype_Opset(c_Tarski_Odual(u,v),v,tc_Product__Type_Ounit),c_Tarski_Opotype_Opset(u,v,tc_Product__Type_Ounit)),
file('LAT262-1.p',unknown),
[] ).
cnf(11,axiom,
c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
file('LAT262-1.p',unknown),
[] ).
cnf(12,axiom,
~ c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)),
file('LAT262-1.p',unknown),
[] ).
cnf(2763,plain,
c_lessequals(v_S,v_A,tc_set(t_a)),
inference(rew,[status(thm),theory(equality)],[1,11]),
[iquote('0:Rew:1.0,11.0')] ).
cnf(2788,plain,
~ c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)),
inference(rew,[status(thm),theory(equality)],[10,12]),
[iquote('0:Rew:10.0,12.0')] ).
cnf(2789,plain,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
inference(rew,[status(thm),theory(equality)],[1,2788]),
[iquote('0:Rew:1.0,2788.0')] ).
cnf(2790,plain,
$false,
inference(mrr,[status(thm)],[2789,2763]),
[iquote('0:MRR:2789.0,2763.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LAT262-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 29 19:31:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.91/1.15
% 0.91/1.15 SPASS V 3.9
% 0.91/1.15 SPASS beiseite: Proof found.
% 0.91/1.15 % SZS status Theorem
% 0.91/1.15 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.91/1.15 SPASS derived 3 clauses, backtracked 0 clauses, performed 0 splits and kept 1562 clauses.
% 0.91/1.15 SPASS allocated 79796 KBytes.
% 0.91/1.15 SPASS spent 0:00:00.74 on the problem.
% 0.91/1.15 0:00:00.20 for the input.
% 0.91/1.15 0:00:00.00 for the FLOTTER CNF translation.
% 0.91/1.15 0:00:00.00 for inferences.
% 0.91/1.15 0:00:00.00 for the backtracking.
% 0.91/1.15 0:00:00.20 for the reduction.
% 0.91/1.15
% 0.91/1.15
% 0.91/1.15 Here is a proof with depth 0, length 8 :
% 0.91/1.15 % SZS output start Refutation
% See solution above
% 0.91/1.15 Formulae used in the proof : cls_Tarski_OA_A_61_61_Apset_Acl_0 cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0 cls_conjecture_0 cls_conjecture_1
% 0.91/1.15
%------------------------------------------------------------------------------