TSTP Solution File: SYN986+1.003 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 06:06:49 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 77 ( 38 ~; 31 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 66 ( 5 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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,X6,X4,X7] :
( r(zero,zero,X5)
& r(zero,X5,X6)
& r(zero,X6,X4)
& r(zero,X4,X7) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ck) ).
fof(c_0_3,plain,
! [X5,X6,X7,X8] :
( ~ r(X5,X6,X7)
| ~ r(X7,X6,X8)
| r(X5,succ(X6),X8) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hyp2])])])]) ).
fof(c_0_4,plain,
! [X2] : r(X2,zero,succ(X2)),
inference(variable_rename,[status(thm)],[hyp1]) ).
cnf(c_0_5,plain,
( r(X1,succ(X2),X3)
| ~ r(X4,X2,X3)
| ~ r(X1,X2,X4) ),
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,plain,
( r(X1,succ(zero),succ(X2))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( r(X1,succ(succ(zero)),succ(X2))
| ~ r(X1,succ(zero),X3)
| ~ r(X3,zero,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( r(X1,succ(succ(zero)),succ(X2))
| ~ r(succ(X3),zero,X2)
| ~ r(X1,zero,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
( r(X1,succ(succ(zero)),succ(succ(succ(X2))))
| ~ r(X1,zero,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
fof(c_0_11,negated_conjecture,
~ ? [X5,X6,X4,X7] :
( r(zero,zero,X5)
& r(zero,X5,X6)
& r(zero,X6,X4)
& r(zero,X4,X7) ),
inference(assume_negation,[status(cth)],[ck]) ).
cnf(c_0_12,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_5,c_0_10]) ).
fof(c_0_13,negated_conjecture,
! [X8,X9,X10,X11] :
( ~ r(zero,zero,X8)
| ~ r(zero,X8,X9)
| ~ r(zero,X9,X10)
| ~ r(zero,X10,X11) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
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_12,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ r(zero,X1,X2)
| ~ r(zero,X3,X1)
| ~ r(zero,X4,X3)
| ~ r(zero,zero,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ r(zero,succ(zero),X1)
| ~ r(zero,X1,X2)
| ~ r(zero,X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
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_5,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ r(zero,succ(X1),X2)
| ~ r(zero,zero,X1)
| ~ r(zero,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
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,negated_conjecture,
( ~ 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_10]),c_0_6])]) ).
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_6]) ).
cnf(c_0_23,negated_conjecture,
~ r(zero,zero,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_6])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_23,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN986+1.003 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 15:46:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 25
% 0.23/1.42 # Proof object clause steps : 18
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 9
% 0.23/1.42 # Proof object clause conjectures : 6
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 3
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 15
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 3
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 3
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 3
% 0.23/1.42 # Processed clauses : 21
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 21
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 1
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 23
% 0.23/1.42 # ...of the previous two non-trivial : 22
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 23
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 20
% 0.23/1.42 # Positive orientable unit clauses : 1
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 1
% 0.23/1.42 # Non-unit-clauses : 18
% 0.23/1.42 # Current number of unprocessed clauses: 3
% 0.23/1.42 # ...number of literals in the above : 8
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 1
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 113
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 101
% 0.23/1.42 # Non-unit clause-clause subsumptions : 1
% 0.23/1.42 # Unit Clause-clause subsumption calls : 13
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 1
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1109
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.013 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.016 s
% 0.23/1.42 # Maximum resident set size: 2796 pages
%------------------------------------------------------------------------------