TSTP Solution File: SYN986+1.003 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 : Thu Jul 21 04:58:40 EDT 2022
% Result : Theorem 7.48s 2.52s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 21 ( 4 unt; 0 nHn; 19 RR)
% Number of literals : 52 ( 0 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 16 ( 2 avg)
% 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 : 53 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( r(X1,succ(X2),X3)
| ~ r(X4,X2,X3)
| ~ r(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zi9h3nav/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
r(X1,zero,succ(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zi9h3nav/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
( ~ r(zero,X1,X2)
| ~ r(zero,X3,X1)
| ~ r(zero,X4,X3)
| ~ r(zero,zero,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zi9h3nav/lgb.p',i_0_1) ).
cnf(c_0_7,plain,
( r(X1,succ(X2),X3)
| ~ r(X4,X2,X3)
| ~ r(X1,X2,X4) ),
i_0_3 ).
cnf(c_0_8,plain,
r(X1,zero,succ(X1)),
i_0_2 ).
cnf(c_0_9,plain,
( r(X1,succ(zero),succ(X2))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
( r(X1,succ(succ(zero)),succ(X2))
| ~ r(X1,succ(zero),X3)
| ~ r(X3,zero,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,plain,
( r(X1,succ(succ(zero)),succ(X2))
| ~ r(succ(X3),zero,X2)
| ~ r(X1,zero,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
( r(X1,succ(succ(zero)),succ(succ(succ(X2))))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,plain,
( r(X1,succ(succ(succ(zero))),succ(succ(succ(X2))))
| ~ r(X1,succ(succ(zero)),X3)
| ~ r(X3,zero,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_14,plain,
( r(X1,succ(succ(succ(zero))),succ(succ(succ(X2))))
| ~ r(succ(succ(succ(X3))),zero,X2)
| ~ r(X1,zero,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ r(zero,X1,X2)
| ~ r(zero,X3,X1)
| ~ r(zero,X4,X3)
| ~ r(zero,zero,X4) ),
i_0_1 ).
cnf(c_0_16,plain,
( r(X1,succ(succ(succ(zero))),succ(succ(succ(succ(succ(succ(succ(X2))))))))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_17,plain,
( ~ r(zero,succ(zero),X1)
| ~ r(zero,X1,X2)
| ~ r(zero,X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_18,plain,
( r(X1,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(X2))))))))
| ~ r(X1,succ(succ(succ(zero))),X3)
| ~ r(X3,zero,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
( ~ r(zero,succ(X1),X2)
| ~ r(zero,zero,X1)
| ~ r(zero,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_20,plain,
( r(X1,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(X2))))))))
| ~ r(succ(succ(succ(succ(succ(succ(succ(X3))))))),zero,X2)
| ~ r(X1,zero,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_21,plain,
( ~ r(zero,succ(succ(succ(X1))),X2)
| ~ r(zero,zero,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_8])]) ).
cnf(c_0_22,plain,
( r(X1,succ(succ(succ(succ(zero)))),succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(succ(X2))))))))))))))))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_23,plain,
~ r(zero,zero,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8])]) ).
cnf(c_0_24,plain,
$false,
inference(spm,[status(thm)],[c_0_23,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 15:53:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.48/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.48/2.52 # No SInE strategy applied
% 7.48/2.52 # Trying AutoSched0 for 150 seconds
% 7.48/2.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.48/2.52 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.48/2.52 #
% 7.48/2.52 # Preprocessing time : 0.014 s
% 7.48/2.52 # Presaturation interreduction done
% 7.48/2.52
% 7.48/2.52 # Proof found!
% 7.48/2.52 # SZS status Theorem
% 7.48/2.52 # SZS output start CNFRefutation
% See solution above
% 7.48/2.52 # Training examples: 0 positive, 0 negative
% 7.48/2.52
% 7.48/2.52 # -------------------------------------------------
% 7.48/2.52 # User time : 0.017 s
% 7.48/2.52 # System time : 0.002 s
% 7.48/2.52 # Total time : 0.019 s
% 7.48/2.52 # Maximum resident set size: 7120 pages
% 7.48/2.52
%------------------------------------------------------------------------------