TSTP Solution File: LAT272-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT272-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:58 EDT 2022
% Result : Unsatisfiable 1.61s 1.77s
% Output : Refutation 1.61s
% 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; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
file('LAT272-1.p',unknown),
[] ).
cnf(7,axiom,
c_in(v_x,v_S,t_a),
file('LAT272-1.p',unknown),
[] ).
cnf(8,axiom,
~ c_in(c_Pair(v_x,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)),
file('LAT272-1.p',unknown),
[] ).
cnf(17,axiom,
( ~ c_in(u,v,t_a)
| ~ c_Tarski_OisLub(v,v_cl,w,t_a)
| c_in(c_Pair(u,w,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
file('LAT272-1.p',unknown),
[] ).
cnf(3459,plain,
( ~ c_in(v_x,u,t_a)
| ~ c_Tarski_OisLub(u,v_cl,v_L,t_a) ),
inference(res,[status(thm),theory(equality)],[17,8]),
[iquote('0:Res:17.2,8.0')] ).
cnf(3539,plain,
~ c_in(v_x,v_S,t_a),
inference(res,[status(thm),theory(equality)],[5,3459]),
[iquote('0:Res:5.0,3459.0')] ).
cnf(3562,plain,
$false,
inference(mrr,[status(thm)],[3539,7]),
[iquote('0:MRR:3539.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT272-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n026.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 : Thu Jun 30 10:51:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.61/1.77
% 1.61/1.77 SPASS V 3.9
% 1.61/1.77 SPASS beiseite: Proof found.
% 1.61/1.77 % SZS status Theorem
% 1.61/1.77 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.61/1.77 SPASS derived 409 clauses, backtracked 0 clauses, performed 0 splits and kept 2888 clauses.
% 1.61/1.77 SPASS allocated 80247 KBytes.
% 1.61/1.77 SPASS spent 0:00:01.37 on the problem.
% 1.61/1.77 0:00:00.23 for the input.
% 1.61/1.77 0:00:00.00 for the FLOTTER CNF translation.
% 1.61/1.77 0:00:00.00 for inferences.
% 1.61/1.77 0:00:00.00 for the backtracking.
% 1.61/1.77 0:00:00.60 for the reduction.
% 1.61/1.77
% 1.61/1.77
% 1.61/1.77 Here is a proof with depth 2, length 7 :
% 1.61/1.77 % SZS output start Refutation
% See solution above
% 1.61/1.77 Formulae used in the proof : cls_conjecture_4 cls_conjecture_6 cls_conjecture_7 cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Ay1_A_58_AS1_A_124_93_A_61_61_62_A_Iy1_M_AL1_J_A_58_Ar_A_61_61_ATrue_0
% 1.61/1.77
%------------------------------------------------------------------------------