TSTP Solution File: CSR113+24 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR113+24 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 : Fri Jul 15 02:49:03 EDT 2022
% Result : Theorem 9.08s 2.75s
% Output : CNFRefutation 9.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 14 unt; 0 nHn; 19 RR)
% Number of literals : 37 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 28 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_905,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ val(X4,new_york_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_905) ).
cnf(i_0_391,hypothesis,
val(c878,new_york_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_391) ).
cnf(i_0_392,hypothesis,
sub(c878,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_392) ).
cnf(i_0_394,hypothesis,
attr(c877,c878),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_394) ).
cnf(i_0_33,plain,
( scar(esk6_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_33) ).
cnf(i_0_775,plain,
member(X1,cons(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_775) ).
cnf(i_0_413,hypothesis,
attr(c791,c792),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_413) ).
cnf(i_0_410,hypothesis,
sub(c792,eigenname_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hnuuqkpr/input.p',i_0_410) ).
cnf(c_0_914,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ val(X4,new_york_0) ),
i_0_905 ).
cnf(c_0_915,hypothesis,
val(c878,new_york_0),
i_0_391 ).
cnf(c_0_916,hypothesis,
sub(c878,name_1_1),
i_0_392 ).
cnf(c_0_917,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,c878) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_914,c_0_915]),c_0_916])]) ).
cnf(c_0_918,hypothesis,
attr(c877,c878),
i_0_394 ).
cnf(c_0_919,hypothesis,
~ scar(X1,X2),
inference(spm,[status(thm)],[c_0_917,c_0_918]) ).
cnf(c_0_920,plain,
( scar(esk6_3(X1,X2,X3),X3)
| ~ sub(X1,X2)
| ~ attr(X3,X1)
| ~ member(X2,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) ),
i_0_33 ).
cnf(c_0_921,plain,
( ~ member(X1,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))))
| ~ attr(X2,X3)
| ~ sub(X3,X1) ),
inference(spm,[status(thm)],[c_0_919,c_0_920]) ).
cnf(c_0_922,plain,
member(X1,cons(X1,X2)),
i_0_775 ).
cnf(c_0_923,plain,
( ~ attr(X1,X2)
| ~ sub(X2,eigenname_1_1) ),
inference(spm,[status(thm)],[c_0_921,c_0_922]) ).
cnf(c_0_924,hypothesis,
attr(c791,c792),
i_0_413 ).
cnf(c_0_925,hypothesis,
sub(c792,eigenname_1_1),
i_0_410 ).
cnf(c_0_926,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_923,c_0_924]),c_0_925])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : CSR113+24 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 11 02:00:53 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.47/0.65 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.47/0.65 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.47/0.65 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.08/2.75 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.08/2.75 # Version: 2.1pre011
% 9.08/2.75 # Preprocessing time : 0.025 s
% 9.08/2.75
% 9.08/2.75 # Proof found!
% 9.08/2.75 # SZS status Theorem
% 9.08/2.75 # SZS output start CNFRefutation
% See solution above
% 9.08/2.75 # Proof object total steps : 21
% 9.08/2.75 # Proof object clause steps : 13
% 9.08/2.75 # Proof object formula steps : 8
% 9.08/2.75 # Proof object conjectures : 3
% 9.08/2.75 # Proof object clause conjectures : 2
% 9.08/2.75 # Proof object formula conjectures : 1
% 9.08/2.75 # Proof object initial clauses used : 8
% 9.08/2.75 # Proof object initial formulas used : 8
% 9.08/2.75 # Proof object generating inferences : 5
% 9.08/2.75 # Proof object simplifying inferences : 4
% 9.08/2.75 # Training examples: 0 positive, 0 negative
% 9.08/2.75 # Parsed axioms : 925
% 9.08/2.75 # Removed by relevancy pruning/SinE : 0
% 9.08/2.75 # Initial clauses : 925
% 9.08/2.75 # Removed in clause preprocessing : 0
% 9.08/2.75 # Initial clauses in saturation : 925
% 9.08/2.75 # Processed clauses : 993
% 9.08/2.75 # ...of these trivial : 2
% 9.08/2.75 # ...subsumed : 11
% 9.08/2.75 # ...remaining for further processing : 980
% 9.08/2.75 # Other redundant clauses eliminated : 0
% 9.08/2.75 # Clauses deleted for lack of memory : 0
% 9.08/2.75 # Backward-subsumed : 41
% 9.08/2.75 # Backward-rewritten : 0
% 9.08/2.75 # Generated clauses : 1868
% 9.08/2.75 # ...of the previous two non-trivial : 1865
% 9.08/2.75 # Contextual simplify-reflections : 4
% 9.08/2.75 # Paramodulations : 1868
% 9.08/2.75 # Factorizations : 0
% 9.08/2.75 # Equation resolutions : 0
% 9.08/2.75 # Propositional unsat checks : 0
% 9.08/2.75 # Propositional unsat check successes : 0
% 9.08/2.75 # Current number of processed clauses : 939
% 9.08/2.75 # Positive orientable unit clauses : 632
% 9.08/2.75 # Positive unorientable unit clauses: 0
% 9.08/2.75 # Negative unit clauses : 8
% 9.08/2.75 # Non-unit-clauses : 299
% 9.08/2.75 # Current number of unprocessed clauses: 1675
% 9.08/2.75 # ...number of literals in the above : 5099
% 9.08/2.75 # Current number of archived formulas : 0
% 9.08/2.75 # Current number of archived clauses : 41
% 9.08/2.75 # Clause-clause subsumption calls (NU) : 38800
% 9.08/2.75 # Rec. Clause-clause subsumption calls : 14165
% 9.08/2.75 # Non-unit clause-clause subsumptions : 45
% 9.08/2.75 # Unit Clause-clause subsumption calls : 4018
% 9.08/2.75 # Rewrite failures with RHS unbound : 0
% 9.08/2.75 # BW rewrite match attempts : 0
% 9.08/2.75 # BW rewrite match successes : 0
% 9.08/2.75 # Condensation attempts : 0
% 9.08/2.75 # Condensation successes : 0
% 9.08/2.75 # Termbank termtop insertions : 35602
% 9.08/2.75
% 9.08/2.75 # -------------------------------------------------
% 9.08/2.75 # User time : 0.055 s
% 9.08/2.75 # System time : 0.010 s
% 9.08/2.75 # Total time : 0.065 s
% 9.08/2.75 # ...preprocessing : 0.025 s
% 9.08/2.75 # ...main loop : 0.040 s
% 9.08/2.75 # Maximum resident set size: 10500 pages
% 9.08/2.75
%------------------------------------------------------------------------------