TSTP Solution File: SWV154+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV154+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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 : Wed Jul 20 21:41:27 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 4 RR)
% Number of literals : 4 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(122,axiom,
equal(sum__dfg(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x__dfg,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x__dfg,pv10))))),pv70),
file('SWV154+1.p',unknown),
[] ).
cnf(149,axiom,
~ equal(divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)),minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)))),sum__dfg(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x__dfg,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x__dfg,pv10)))))),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)),minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)))),pv70)),
file('SWV154+1.p',unknown),
[] ).
cnf(163,plain,
~ equal(divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)),minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)))),pv70),divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)),minus(a_select3(center,pv12,n0),a_select2(x__dfg,pv10)))),pv70)),
inference(rew,[status(thm),theory(equality)],[122,149]),
[iquote('0:Rew:122.0,149.0')] ).
cnf(164,plain,
$false,
inference(obv,[status(thm),theory(equality)],[163]),
[iquote('0:Obv:163.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV154+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 : Wed Jun 15 12:18:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.51
% 0.19/0.51 SPASS V 3.9
% 0.19/0.51 SPASS beiseite: Proof found.
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 135 clauses.
% 0.19/0.51 SPASS allocated 85816 KBytes.
% 0.19/0.51 SPASS spent 0:00:00.16 on the problem.
% 0.19/0.51 0:00:00.04 for the input.
% 0.19/0.51 0:00:00.08 for the FLOTTER CNF translation.
% 0.19/0.51 0:00:00.00 for inferences.
% 0.19/0.51 0:00:00.00 for the backtracking.
% 0.19/0.51 0:00:00.01 for the reduction.
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Here is a proof with depth 0, length 4 :
% 0.19/0.51 % SZS output start Refutation
% See solution above
% 0.19/0.51 Formulae used in the proof : cl5_nebula_norm_0004
% 0.19/0.51
%------------------------------------------------------------------------------