TSTP Solution File: SWB003+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWB003+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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 : Tue Jul 19 19:20:53 EDT 2022
% Result : Theorem 57.97s 58.14s
% Output : Refutation 57.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 2
% Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 3 RR)
% Number of literals : 3 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(215,axiom,
~ iext(uri_ex,uri_ex_s,u),
file('SWB003+1.p',unknown),
[] ).
cnf(216,axiom,
iext(uri_ex,uri_ex_s,literal_plain(dat_str_foo)),
file('SWB003+1.p',unknown),
[] ).
cnf(1192,plain,
$false,
inference(unc,[status(thm)],[215,216]),
[iquote('0:UnC:215.0,216.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWB003+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 1 09:11:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 57.97/58.14
% 57.97/58.14 SPASS V 3.9
% 57.97/58.14 SPASS beiseite: Proof found.
% 57.97/58.14 % SZS status Theorem
% 57.97/58.14 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 57.97/58.14 SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 220 clauses.
% 57.97/58.14 SPASS allocated 188949 KBytes.
% 57.97/58.14 SPASS spent 0:0:57.75 on the problem.
% 57.97/58.14 0:00:00.04 for the input.
% 57.97/58.14 0:0:57.48 for the FLOTTER CNF translation.
% 57.97/58.14 0:00:00.00 for inferences.
% 57.97/58.14 0:00:00.00 for the backtracking.
% 57.97/58.14 0:00:00.03 for the reduction.
% 57.97/58.14
% 57.97/58.14
% 57.97/58.14 Here is a proof with depth 0, length 3 :
% 57.97/58.14 % SZS output start Refutation
% See solution above
% 57.97/58.14 Formulae used in the proof : testcase_conclusion_fullish_003_Blank_Nodes_for_Literals testcase_premise_fullish_003_Blank_Nodes_for_Literals
% 57.97/58.14
%------------------------------------------------------------------------------