TSTP Solution File: SYN986+1.003 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN986+1.003 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:42:52 EDT 2023
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% 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/sandbox2/tmp/tmp.tnnsTHHAkB/E---3.1_28923.p',hyp2) ).
fof(hyp1,axiom,
! [X1] : r(X1,zero,succ(X1)),
file('/export/starexec/sandbox2/tmp/tmp.tnnsTHHAkB/E---3.1_28923.p',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/sandbox2/tmp/tmp.tnnsTHHAkB/E---3.1_28923.p',ck) ).
fof(c_0_3,plain,
! [X13,X14,X15,X16] :
( ~ r(X13,X14,X15)
| ~ r(X15,X14,X16)
| r(X13,succ(X14),X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hyp2])]) ).
fof(c_0_4,plain,
! [X12] : r(X12,zero,succ(X12)),
inference(variable_rename,[status(thm)],[hyp1]) ).
cnf(c_0_5,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_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(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,zero,X1)
| ~ r(zero,X1,X2)
| ~ r(zero,X2,X3)
| ~ r(zero,X3,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,X2,X3)
| ~ r(zero,X1,X2) ),
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.03/0.12 % Problem : SYN986+1.003 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n005.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.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 18:09:01 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.tnnsTHHAkB/E---3.1_28923.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # new_bool_1 with pid 29041 completed with status 0
% 0.20/0.52 # Result found by new_bool_1
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FHHNF-FFSF11-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29045 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 # Search class: FHHNF-FFSF11-SFFFFFNN
% 0.20/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.20/0.52 # Preprocessing time : 0.002 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 3
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 3
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 3
% 0.20/0.52 # Processed clauses : 24
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 1
% 0.20/0.52 # ...remaining for further processing : 23
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 6
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 21
% 0.20/0.52 # ...of the previous two non-redundant : 20
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 21
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 2
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 14
% 0.20/0.52 # Positive orientable unit clauses : 1
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 12
% 0.20/0.52 # Current number of unprocessed clauses: 2
% 0.20/0.52 # ...number of literals in the above : 6
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 9
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 105
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 86
% 0.20/0.52 # Non-unit clause-clause subsumptions : 2
% 0.20/0.52 # Unit Clause-clause subsumption calls : 12
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 1012
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.007 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.009 s
% 0.20/0.52 # Maximum resident set size: 1756 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.010 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.013 s
% 0.20/0.52 # Maximum resident set size: 1676 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------