TSTP Solution File: NUM341+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : NUM341+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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 14:25:26 EDT 2022
% Result : Theorem 0.45s 0.67s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 3 unt; 1 nHn; 7 RR)
% Number of literals : 12 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(42,axiom,
( difference(u,v,w)
| sum__dfg(v,w,u) ),
file('NUM341+1.p',unknown),
[] ).
cnf(227,axiom,
( ~ sum__dfg(u,v,w)
| difference(w,u,v) ),
file('NUM341+1.p',unknown),
[] ).
cnf(228,axiom,
( ~ difference(u,v,w)
| sum__dfg(v,w,u) ),
file('NUM341+1.p',unknown),
[] ).
cnf(395,axiom,
( ~ sum__dfg(u,v,w)
| ~ difference(w,v,u)
| ~ difference(w,u,v) ),
file('NUM341+1.p',unknown),
[] ).
cnf(410,plain,
sum__dfg(u,v,w),
inference(mrr,[status(thm)],[228,42]),
[iquote('0:MRR:228.0,42.0')] ).
cnf(411,plain,
difference(u,v,w),
inference(mrr,[status(thm)],[227,410]),
[iquote('0:MRR:227.0,410.0')] ).
cnf(414,plain,
$false,
inference(mrr,[status(thm)],[395,410,411]),
[iquote('0:MRR:395.0,395.1,395.2,410.0,411.0,411.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM341+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.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 : Thu Jul 7 18:08:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/0.67
% 0.45/0.67 SPASS V 3.9
% 0.45/0.67 SPASS beiseite: Proof found.
% 0.45/0.67 % SZS status Theorem
% 0.45/0.67 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.45/0.67 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 392 clauses.
% 0.45/0.67 SPASS allocated 98723 KBytes.
% 0.45/0.67 SPASS spent 0:00:00.30 on the problem.
% 0.45/0.67 0:00:00.05 for the input.
% 0.45/0.67 0:00:00.12 for the FLOTTER CNF translation.
% 0.45/0.67 0:00:00.00 for inferences.
% 0.45/0.67 0:00:00.00 for the backtracking.
% 0.45/0.67 0:00:00.06 for the reduction.
% 0.45/0.67
% 0.45/0.67
% 0.45/0.67 Here is a proof with depth 0, length 7 :
% 0.45/0.67 % SZS output start Refutation
% See solution above
% 0.45/0.67 Formulae used in the proof : add_same_as_subtract minus_entry_point
% 0.45/0.67
%------------------------------------------------------------------------------