TSTP Solution File: SWB003+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 : 300s
% DateTime : Thu Aug 31 20:01:45 EDT 2023
% Result : Theorem 0.22s 0.60s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 12 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 4 ( 1 sgn; 1 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
uri_ex_p: $i ).
tff(decl_23,type,
uri_ex_s: $i ).
tff(decl_24,type,
iext: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
dat_str_foo: $i ).
tff(decl_26,type,
literal_plain: $i > $i ).
fof(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals,conjecture,
? [X1] : iext(uri_ex_p,uri_ex_s,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
fof(testcase_premise_fullish_003_Blank_Nodes_for_Literals,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] : iext(uri_ex_p,uri_ex_s,X1),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_003_Blank_Nodes_for_Literals]) ).
fof(c_0_3,negated_conjecture,
! [X2] : ~ iext(uri_ex_p,uri_ex_s,X2),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
cnf(c_0_4,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_003_Blank_Nodes_for_Literals]) ).
cnf(c_0_5,negated_conjecture,
~ iext(uri_ex_p,uri_ex_s,X1),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
$false,
inference(sr,[status(thm)],[c_0_4,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.15 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun Aug 27 07:36:09 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.22/0.60 % Version : CSE_E---1.5
% 0.22/0.60 % Problem : theBenchmark.p
% 0.22/0.60 % Proof found
% 0.22/0.60 % SZS status Theorem for theBenchmark.p
% 0.22/0.60 % SZS output start Proof
% See solution above
% 0.22/0.60 % Total time : 0.003000 s
% 0.22/0.60 % SZS output end Proof
% 0.22/0.60 % Total time : 0.004000 s
%------------------------------------------------------------------------------