TSTP Solution File: SYN986+1.002 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN986+1.002 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 600s
% DateTime : Thu Jul 21 04:58:40 EDT 2022
% Result : Theorem 6.83s 2.19s
% Output : CNFRefutation 6.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 14 ( 4 unt; 0 nHn; 12 RR)
% Number of literals : 30 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 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 : 31 ( 5 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-409ayykk/input.p',i_0_3) ).
cnf(i_0_2,plain,
r(X1,zero,succ(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-409ayykk/input.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
( ~ r(zero,X1,X2)
| ~ r(zero,X3,X1)
| ~ r(zero,zero,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-409ayykk/input.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,negated_conjecture,
( ~ r(zero,X1,X2)
| ~ r(zero,X3,X1)
| ~ r(zero,zero,X3) ),
i_0_1 ).
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_7,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_8]) ).
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_8]) ).
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_8])]) ).
cnf(c_0_17,plain,
$false,
inference(spm,[status(thm)],[c_0_16,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN986+1.002 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n009.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 : Tue Jul 12 04:59:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.83/2.19 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.83/2.19 # Version: 2.1pre011
% 6.83/2.19 # Preprocessing time : 0.011 s
% 6.83/2.19
% 6.83/2.19 # Proof found!
% 6.83/2.19 # SZS status Theorem
% 6.83/2.19 # SZS output start CNFRefutation
% See solution above
% 6.83/2.19 # Proof object total steps : 14
% 6.83/2.19 # Proof object clause steps : 11
% 6.83/2.19 # Proof object formula steps : 3
% 6.83/2.19 # Proof object conjectures : 5
% 6.83/2.19 # Proof object clause conjectures : 4
% 6.83/2.19 # Proof object formula conjectures : 1
% 6.83/2.19 # Proof object initial clauses used : 3
% 6.83/2.19 # Proof object initial formulas used : 3
% 6.83/2.19 # Proof object generating inferences : 8
% 6.83/2.19 # Proof object simplifying inferences : 2
% 6.83/2.19 # Training examples: 0 positive, 0 negative
% 6.83/2.19 # Parsed axioms : 3
% 6.83/2.19 # Removed by relevancy pruning/SinE : 0
% 6.83/2.19 # Initial clauses : 3
% 6.83/2.19 # Removed in clause preprocessing : 0
% 6.83/2.19 # Initial clauses in saturation : 3
% 6.83/2.19 # Processed clauses : 13
% 6.83/2.19 # ...of these trivial : 0
% 6.83/2.19 # ...subsumed : 0
% 6.83/2.19 # ...remaining for further processing : 13
% 6.83/2.19 # Other redundant clauses eliminated : 0
% 6.83/2.19 # Clauses deleted for lack of memory : 0
% 6.83/2.19 # Backward-subsumed : 0
% 6.83/2.19 # Backward-rewritten : 0
% 6.83/2.19 # Generated clauses : 12
% 6.83/2.19 # ...of the previous two non-trivial : 11
% 6.83/2.19 # Contextual simplify-reflections : 0
% 6.83/2.19 # Paramodulations : 12
% 6.83/2.19 # Factorizations : 0
% 6.83/2.19 # Equation resolutions : 0
% 6.83/2.19 # Propositional unsat checks : 0
% 6.83/2.19 # Propositional unsat check successes : 0
% 6.83/2.19 # Current number of processed clauses : 13
% 6.83/2.19 # Positive orientable unit clauses : 1
% 6.83/2.19 # Positive unorientable unit clauses: 0
% 6.83/2.19 # Negative unit clauses : 1
% 6.83/2.19 # Non-unit-clauses : 11
% 6.83/2.19 # Current number of unprocessed clauses: 1
% 6.83/2.19 # ...number of literals in the above : 2
% 6.83/2.19 # Current number of archived formulas : 0
% 6.83/2.19 # Current number of archived clauses : 0
% 6.83/2.19 # Clause-clause subsumption calls (NU) : 42
% 6.83/2.19 # Rec. Clause-clause subsumption calls : 32
% 6.83/2.19 # Non-unit clause-clause subsumptions : 0
% 6.83/2.19 # Unit Clause-clause subsumption calls : 8
% 6.83/2.19 # Rewrite failures with RHS unbound : 0
% 6.83/2.19 # BW rewrite match attempts : 1
% 6.83/2.19 # BW rewrite match successes : 0
% 6.83/2.19 # Condensation attempts : 0
% 6.83/2.19 # Condensation successes : 0
% 6.83/2.19 # Termbank termtop insertions : 368
% 6.83/2.19
% 6.83/2.19 # -------------------------------------------------
% 6.83/2.19 # User time : 0.007 s
% 6.83/2.19 # System time : 0.004 s
% 6.83/2.19 # Total time : 0.011 s
% 6.83/2.19 # ...preprocessing : 0.011 s
% 6.83/2.19 # ...main loop : 0.000 s
% 6.83/2.19 # Maximum resident set size: 7128 pages
% 6.83/2.19
%------------------------------------------------------------------------------