TSTP Solution File: SYN986+1.002 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN986+1.002 : 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 : n025.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:29 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 5 unt; 3 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 44 ( 22 ~; 16 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 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 : 42 ( 4 sgn; 13 !; 6 ?; 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(hyp2,axiom,
! [X1,X2,X3,X4] :
( r(X1,X2,X3)
=> ( r(X3,X2,X4)
=> r(X1,succ(X2),X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp2) ).
fof(hyp1,axiom,
! [X1] : r(X1,zero,succ(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SYN002+0.ax',hyp1) ).
fof(ck,conjecture,
? [X5,X4,X6] :
( r(zero,zero,X5)
& r(zero,X5,X4)
& r(zero,X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ck) ).
fof(c_0_3,plain,
! [X8,X9,X10,X11] :
( ~ r(X8,X9,X10)
| ~ r(X10,X9,X11)
| r(X8,succ(X9),X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hyp2])]) ).
fof(c_0_4,plain,
! [X7] : r(X7,zero,succ(X7)),
inference(variable_rename,[status(thm)],[hyp1]) ).
fof(c_0_5,negated_conjecture,
~ ? [X5,X4,X6] :
( r(zero,zero,X5)
& r(zero,X5,X4)
& r(zero,X4,X6) ),
inference(assume_negation,[status(cth)],[ck]) ).
cnf(c_0_6,plain,
( r(X1,succ(X2),X4)
| ~ r(X1,X2,X3)
| ~ r(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
r(X1,zero,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
! [X12,X13,X14] :
( ~ r(zero,zero,X12)
| ~ r(zero,X12,X13)
| ~ r(zero,X13,X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( r(X1,succ(zero),succ(X2))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ r(zero,zero,X1)
| ~ r(zero,X1,X2)
| ~ r(zero,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( r(X1,succ(succ(zero)),succ(X2))
| ~ r(X1,succ(zero),X3)
| ~ r(X3,zero,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ r(zero,succ(zero),X1)
| ~ r(zero,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_13,plain,
( r(X1,succ(succ(zero)),succ(X2))
| ~ r(succ(X3),zero,X2)
| ~ r(X1,zero,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ r(zero,succ(X1),X2)
| ~ r(zero,zero,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
( r(X1,succ(succ(zero)),succ(succ(succ(X2))))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
~ r(zero,zero,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_16,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN986+1.002 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.15 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n025.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.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sat Aug 26 21:12:23 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.005000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.008000 s
%------------------------------------------------------------------------------