TSTP Solution File: LAT270-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT270-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:57 EDT 2022
% Result : Unsatisfiable 1.55s 1.74s
% Output : Refutation 1.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_in(v_a,v_A,t_a),
file('LAT270-1.p',unknown),
[] ).
cnf(2,axiom,
c_in(v_b,v_A,t_a),
file('LAT270-1.p',unknown),
[] ).
cnf(3,axiom,
c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
file('LAT270-1.p',unknown),
[] ).
cnf(7,axiom,
~ c_lessequals(v_S,v_A,tc_set(t_a)),
file('LAT270-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ c_in(u,v_A,t_a)
| ~ c_in(v,v_A,t_a)
| ~ c_lessequals(w,c_Tarski_Ointerval(v_r,u,v,t_a),tc_set(t_a))
| c_lessequals(w,v_A,tc_set(t_a)) ),
file('LAT270-1.p',unknown),
[] ).
cnf(3402,plain,
( ~ c_in(v_b,v_A,t_a)
| ~ c_in(v_a,v_A,t_a)
| c_lessequals(v_S,v_A,tc_set(t_a)) ),
inference(res,[status(thm),theory(equality)],[3,15]),
[iquote('0:Res:3.0,15.2')] ).
cnf(3460,plain,
$false,
inference(mrr,[status(thm)],[3402,2,1,7]),
[iquote('0:MRR:3402.0,3402.1,3402.2,2.0,1.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT270-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Wed Jun 29 02:03:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.55/1.74
% 1.55/1.74 SPASS V 3.9
% 1.55/1.74 SPASS beiseite: Proof found.
% 1.55/1.74 % SZS status Theorem
% 1.55/1.74 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.55/1.74 SPASS derived 309 clauses, backtracked 0 clauses, performed 0 splits and kept 2755 clauses.
% 1.55/1.74 SPASS allocated 80177 KBytes.
% 1.55/1.74 SPASS spent 0:00:01.32 on the problem.
% 1.55/1.74 0:00:00.23 for the input.
% 1.55/1.74 0:00:00.00 for the FLOTTER CNF translation.
% 1.55/1.74 0:00:00.00 for inferences.
% 1.55/1.74 0:00:00.00 for the backtracking.
% 1.55/1.74 0:00:00.63 for the reduction.
% 1.55/1.74
% 1.55/1.74
% 1.55/1.74 Here is a proof with depth 1, length 7 :
% 1.55/1.74 % SZS output start Refutation
% See solution above
% 1.55/1.74 Formulae used in the proof : cls_conjecture_0 cls_conjecture_1 cls_conjecture_2 cls_conjecture_6 cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0
% 1.55/1.74
%------------------------------------------------------------------------------