%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR113+22 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 7.03s 2.68s
% Output : CNFRefutation 7.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 44 ( 0 equ; 27 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 : 37 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_801,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ val(X4,new_york_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_801) ).
cnf(i_0_301,hypothesis,
val(c80,new_york_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_301) ).
cnf(i_0_302,hypothesis,
sub(c80,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_302) ).
cnf(i_0_304,hypothesis,
attr(c79,c80),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_304) ).
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/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_33) ).
cnf(i_0_672,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_672) ).
cnf(i_0_671,plain,
member(X1,cons(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_671) ).
cnf(i_0_300,hypothesis,
attr(c83,c84),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_300) ).
cnf(i_0_298,hypothesis,
sub(c84,familiename_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c01bt3w2/input.p',i_0_298) ).
cnf(c_0_811,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ val(X4,new_york_0) ),
i_0_801 ).
cnf(c_0_812,hypothesis,
val(c80,new_york_0),
i_0_301 ).
cnf(c_0_813,hypothesis,
sub(c80,name_1_1),
i_0_302 ).
cnf(c_0_814,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,c80) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_811,c_0_812]),c_0_813])]) ).
cnf(c_0_815,hypothesis,
attr(c79,c80),
i_0_304 ).
cnf(c_0_816,hypothesis,
~ scar(X1,X2),
inference(spm,[status(thm)],[c_0_814,c_0_815]) ).
cnf(c_0_817,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_818,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_816,c_0_817]) ).
cnf(c_0_819,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
i_0_672 ).
cnf(c_0_820,plain,
( ~ member(X1,cons(familiename_1_1,cons(name_1_1,nil)))
| ~ attr(X2,X3)
| ~ sub(X3,X1) ),
inference(spm,[status(thm)],[c_0_818,c_0_819]) ).
cnf(c_0_821,plain,
member(X1,cons(X1,X2)),
i_0_671 ).
cnf(c_0_822,plain,
( ~ attr(X1,X2)
| ~ sub(X2,familiename_1_1) ),
inference(spm,[status(thm)],[c_0_820,c_0_821]) ).
cnf(c_0_823,hypothesis,
attr(c83,c84),
i_0_300 ).
cnf(c_0_824,hypothesis,
sub(c84,familiename_1_1),
i_0_298 ).
cnf(c_0_825,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_822,c_0_823]),c_0_824])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR113+22 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n019.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 : Fri Jun 10 22:52:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.43/0.61 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.03/2.68 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.03/2.68 # Version: 2.1pre011
% 7.03/2.68 # Preprocessing time : 0.024 s
% 7.03/2.68
% 7.03/2.68 # Proof found!
% 7.03/2.68 # SZS status Theorem
% 7.03/2.68 # SZS output start CNFRefutation
% See solution above
% 7.03/2.68 # Proof object total steps : 24
% 7.03/2.68 # Proof object clause steps : 15
% 7.03/2.68 # Proof object formula steps : 9
% 7.03/2.68 # Proof object conjectures : 3
% 7.03/2.68 # Proof object clause conjectures : 2
% 7.03/2.68 # Proof object formula conjectures : 1
% 7.03/2.68 # Proof object initial clauses used : 9
% 7.03/2.68 # Proof object initial formulas used : 9
% 7.03/2.68 # Proof object generating inferences : 6
% 7.03/2.68 # Proof object simplifying inferences : 4
% 7.03/2.68 # Training examples: 0 positive, 0 negative
% 7.03/2.68 # Parsed axioms : 821
% 7.03/2.68 # Removed by relevancy pruning/SinE : 0
% 7.03/2.68 # Initial clauses : 821
% 7.03/2.68 # Removed in clause preprocessing : 0
% 7.03/2.68 # Initial clauses in saturation : 821
% 7.03/2.68 # Processed clauses : 942
% 7.03/2.68 # ...of these trivial : 2
% 7.03/2.68 # ...subsumed : 16
% 7.03/2.68 # ...remaining for further processing : 924
% 7.03/2.68 # Other redundant clauses eliminated : 0
% 7.03/2.68 # Clauses deleted for lack of memory : 0
% 7.03/2.68 # Backward-subsumed : 63
% 7.03/2.68 # Backward-rewritten : 0
% 7.03/2.68 # Generated clauses : 805
% 7.03/2.68 # ...of the previous two non-trivial : 801
% 7.03/2.68 # Contextual simplify-reflections : 3
% 7.03/2.68 # Paramodulations : 805
% 7.03/2.68 # Factorizations : 0
% 7.03/2.68 # Equation resolutions : 0
% 7.03/2.68 # Propositional unsat checks : 0
% 7.03/2.68 # Propositional unsat check successes : 0
% 7.03/2.68 # Current number of processed clauses : 861
% 7.03/2.68 # Positive orientable unit clauses : 539
% 7.03/2.68 # Positive unorientable unit clauses: 0
% 7.03/2.68 # Negative unit clauses : 13
% 7.03/2.68 # Non-unit-clauses : 309
% 7.03/2.68 # Current number of unprocessed clauses: 550
% 7.03/2.68 # ...number of literals in the above : 2175
% 7.03/2.68 # Current number of archived formulas : 0
% 7.03/2.68 # Current number of archived clauses : 63
% 7.03/2.68 # Clause-clause subsumption calls (NU) : 34352
% 7.03/2.68 # Rec. Clause-clause subsumption calls : 13264
% 7.03/2.68 # Non-unit clause-clause subsumptions : 66
% 7.03/2.68 # Unit Clause-clause subsumption calls : 3255
% 7.03/2.68 # Rewrite failures with RHS unbound : 0
% 7.03/2.68 # BW rewrite match attempts : 0
% 7.03/2.68 # BW rewrite match successes : 0
% 7.03/2.68 # Condensation attempts : 0
% 7.03/2.68 # Condensation successes : 0
% 7.03/2.68 # Termbank termtop insertions : 25683
% 7.03/2.68
% 7.03/2.68 # -------------------------------------------------
% 7.03/2.68 # User time : 0.054 s
% 7.03/2.68 # System time : 0.006 s
% 7.03/2.68 # Total time : 0.060 s
% 7.03/2.68 # ...preprocessing : 0.024 s
% 7.03/2.68 # ...main loop : 0.036 s
% 7.03/2.68 # Maximum resident set size: 9180 pages
% 7.03/2.68
%------------------------------------------------------------------------------