TSTP Solution File: NUN073+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN073+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 : Mon Jul 18 16:24:56 EDT 2022
% Result : Theorem 7.64s 2.41s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 18 RR)
% Number of literals : 31 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 17 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_49,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_49) ).
cnf(i_0_60,negated_conjecture,
r2(esk25_0,esk24_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_60) ).
cnf(i_0_27,plain,
( id(X1,X2)
| ~ id(X3,X4)
| ~ r2(X2,X4)
| ~ r2(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_27) ).
cnf(i_0_59,negated_conjecture,
r2(esk24_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_59) ).
cnf(i_0_64,negated_conjecture,
r1(esk23_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_64) ).
cnf(i_0_63,negated_conjecture,
r2(esk23_0,esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_63) ).
cnf(i_0_62,negated_conjecture,
id(esk22_0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lg9aa3qn/input.p',i_0_62) ).
cnf(c_0_72,plain,
( ~ r1(X1)
| ~ id(X1,X2)
| ~ r2(X3,X2) ),
i_0_49 ).
cnf(c_0_73,negated_conjecture,
r2(esk25_0,esk24_0),
i_0_60 ).
cnf(c_0_74,plain,
( id(X1,X2)
| ~ id(X3,X4)
| ~ r2(X2,X4)
| ~ r2(X1,X3) ),
i_0_27 ).
cnf(c_0_75,negated_conjecture,
r2(esk24_0,esk21_0),
i_0_59 ).
cnf(c_0_76,negated_conjecture,
( ~ id(X1,esk24_0)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
r1(esk23_0),
i_0_64 ).
cnf(c_0_78,negated_conjecture,
( id(X1,esk24_0)
| ~ r2(X1,X2)
| ~ id(X2,esk21_0) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,negated_conjecture,
r2(esk23_0,esk22_0),
i_0_63 ).
cnf(c_0_80,negated_conjecture,
id(esk22_0,esk21_0),
i_0_62 ).
cnf(c_0_81,negated_conjecture,
~ id(esk23_0,esk24_0),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUN073+1 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 07:28:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.64/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.64/2.41 # Version: 2.1pre011
% 7.64/2.41 # Preprocessing time : 0.012 s
% 7.64/2.41
% 7.64/2.41 # Proof found!
% 7.64/2.41 # SZS status Theorem
% 7.64/2.41 # SZS output start CNFRefutation
% See solution above
% 7.64/2.41 # Proof object total steps : 18
% 7.64/2.41 # Proof object clause steps : 11
% 7.64/2.41 # Proof object formula steps : 7
% 7.64/2.41 # Proof object conjectures : 14
% 7.64/2.41 # Proof object clause conjectures : 9
% 7.64/2.41 # Proof object formula conjectures : 5
% 7.64/2.41 # Proof object initial clauses used : 7
% 7.64/2.41 # Proof object initial formulas used : 7
% 7.64/2.41 # Proof object generating inferences : 4
% 7.64/2.41 # Proof object simplifying inferences : 3
% 7.64/2.41 # Training examples: 0 positive, 0 negative
% 7.64/2.41 # Parsed axioms : 48
% 7.64/2.41 # Removed by relevancy pruning/SinE : 0
% 7.64/2.41 # Initial clauses : 48
% 7.64/2.41 # Removed in clause preprocessing : 0
% 7.64/2.41 # Initial clauses in saturation : 48
% 7.64/2.41 # Processed clauses : 156
% 7.64/2.41 # ...of these trivial : 1
% 7.64/2.41 # ...subsumed : 31
% 7.64/2.41 # ...remaining for further processing : 124
% 7.64/2.41 # Other redundant clauses eliminated : 0
% 7.64/2.41 # Clauses deleted for lack of memory : 0
% 7.64/2.41 # Backward-subsumed : 0
% 7.64/2.41 # Backward-rewritten : 0
% 7.64/2.41 # Generated clauses : 432
% 7.64/2.41 # ...of the previous two non-trivial : 386
% 7.64/2.41 # Contextual simplify-reflections : 3
% 7.64/2.41 # Paramodulations : 432
% 7.64/2.41 # Factorizations : 0
% 7.64/2.41 # Equation resolutions : 0
% 7.64/2.41 # Propositional unsat checks : 0
% 7.64/2.41 # Propositional unsat check successes : 0
% 7.64/2.41 # Current number of processed clauses : 124
% 7.64/2.41 # Positive orientable unit clauses : 39
% 7.64/2.41 # Positive unorientable unit clauses: 0
% 7.64/2.41 # Negative unit clauses : 22
% 7.64/2.41 # Non-unit-clauses : 63
% 7.64/2.41 # Current number of unprocessed clauses: 274
% 7.64/2.41 # ...number of literals in the above : 695
% 7.64/2.41 # Current number of archived formulas : 0
% 7.64/2.41 # Current number of archived clauses : 0
% 7.64/2.41 # Clause-clause subsumption calls (NU) : 735
% 7.64/2.41 # Rec. Clause-clause subsumption calls : 448
% 7.64/2.41 # Non-unit clause-clause subsumptions : 9
% 7.64/2.41 # Unit Clause-clause subsumption calls : 792
% 7.64/2.41 # Rewrite failures with RHS unbound : 0
% 7.64/2.41 # BW rewrite match attempts : 10
% 7.64/2.41 # BW rewrite match successes : 0
% 7.64/2.41 # Condensation attempts : 0
% 7.64/2.41 # Condensation successes : 0
% 7.64/2.41 # Termbank termtop insertions : 4945
% 7.64/2.41
% 7.64/2.41 # -------------------------------------------------
% 7.64/2.41 # User time : 0.012 s
% 7.64/2.41 # System time : 0.006 s
% 7.64/2.41 # Total time : 0.018 s
% 7.64/2.41 # ...preprocessing : 0.012 s
% 7.64/2.41 # ...main loop : 0.006 s
% 7.64/2.41 # Maximum resident set size: 7128 pages
% 7.64/2.41
%------------------------------------------------------------------------------