TSTP Solution File: ITP001+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : ITP001+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n009.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 03:10:04 EDT 2023
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 16 ( 4 unt; 12 typ; 0 def)
% Number of atoms : 4 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 9 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
bool: $i ).
tff(decl_23,type,
ne: $i > $o ).
tff(decl_24,type,
ind: $i ).
tff(decl_25,type,
arr: ( $i * $i ) > $i ).
tff(decl_26,type,
mem: ( $i * $i ) > $o ).
tff(decl_27,type,
ap: ( $i * $i ) > $i ).
tff(decl_28,type,
p: $i > $o ).
tff(decl_29,type,
k: ( $i * $i ) > $i ).
tff(decl_30,type,
i: $i > $i ).
tff(decl_31,type,
c_2Ebool_2ET: $i ).
tff(decl_32,type,
c_2Emin_2E_3D: $i > $i ).
tff(decl_33,type,
esk1_4: ( $i * $i * $i * $i ) > $i ).
fof(conj_thm_2Ebool_2ETRUTH,conjecture,
$true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2Ebool_2ETRUTH) ).
fof(c_0_1,negated_conjecture,
~ $true,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Ebool_2ETRUTH])]) ).
cnf(c_0_2,negated_conjecture,
$false,
inference(split_conjunct,[status(thm)],[c_0_1]) ).
cnf(c_0_3,negated_conjecture,
$false,
inference(cn,[status(thm)],[c_0_2]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP001+2 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 12:10:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.55 start to proof: theBenchmark
% 0.20/0.56 % Version : CSE_E---1.5
% 0.20/0.56 % Problem : theBenchmark.p
% 0.20/0.56 % Proof found
% 0.20/0.56 % SZS status Theorem for theBenchmark.p
% 0.20/0.56 % SZS output start Proof
% See solution above
% 0.20/0.56 % Total time : 0.004000 s
% 0.20/0.56 % SZS output end Proof
% 0.20/0.56 % Total time : 0.007000 s
%------------------------------------------------------------------------------