TSTP Solution File: SYN986+1.000 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN986+1.000 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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 : Fri Sep 1 02:00:28 EDT 2023
% Result : Theorem 0.18s 0.61s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 11 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 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 : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 7 ( 1 sgn; 3 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
zero: $i ).
tff(decl_23,type,
succ: $i > $i ).
tff(decl_24,type,
r: ( $i * $i * $i ) > $o ).
fof(ck,conjecture,
? [X5] : r(zero,zero,X5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ck) ).
fof(hyp1,axiom,
! [X1] : r(X1,zero,succ(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp1) ).
fof(c_0_2,negated_conjecture,
~ ? [X5] : r(zero,zero,X5),
inference(assume_negation,[status(cth)],[ck]) ).
fof(c_0_3,negated_conjecture,
! [X11] : ~ r(zero,zero,X11),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_4,plain,
! [X6] : r(X6,zero,succ(X6)),
inference(variable_rename,[status(thm)],[hyp1]) ).
cnf(c_0_5,negated_conjecture,
~ r(zero,zero,X1),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
r(X1,zero,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN986+1.000 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n029.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 : 300
% 0.12/0.33 % DateTime : Sat Aug 26 21:56:25 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.59 start to proof: theBenchmark
% 0.18/0.61 % Version : CSE_E---1.5
% 0.18/0.61 % Problem : theBenchmark.p
% 0.18/0.61 % Proof found
% 0.18/0.61 % SZS status Theorem for theBenchmark.p
% 0.18/0.61 % SZS output start Proof
% See solution above
% 0.18/0.61 % Total time : 0.003000 s
% 0.18/0.61 % SZS output end Proof
% 0.18/0.61 % Total time : 0.006000 s
%------------------------------------------------------------------------------