TSTP Solution File: CSR113+9 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR113+9 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:05 EDT 2022
% Result : Theorem 5.09s 2.67s
% Output : CNFRefutation 5.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 14 unt; 0 nHn; 21 RR)
% Number of literals : 47 ( 0 equ; 30 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 : 40 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_796,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ val(X4,usa_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_796) ).
cnf(i_0_300,hypothesis,
val(c17911,usa_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_300) ).
cnf(i_0_301,hypothesis,
sub(c17911,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_301) ).
cnf(i_0_303,hypothesis,
attr(c17910,c17911),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_303) ).
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-fqceoedb/input.p',i_0_33) ).
cnf(i_0_667,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_667) ).
cnf(i_0_666,plain,
member(X1,cons(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_666) ).
cnf(i_0_295,hypothesis,
attr(c17940,c17941),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_295) ).
cnf(i_0_293,hypothesis,
sub(c17941,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fqceoedb/input.p',i_0_293) ).
cnf(c_0_806,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ val(X4,usa_0) ),
i_0_796 ).
cnf(c_0_807,hypothesis,
val(c17911,usa_0),
i_0_300 ).
cnf(c_0_808,hypothesis,
sub(c17911,name_1_1),
i_0_301 ).
cnf(c_0_809,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,c17911) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_806,c_0_807]),c_0_808])]) ).
cnf(c_0_810,hypothesis,
attr(c17910,c17911),
i_0_303 ).
cnf(c_0_811,hypothesis,
~ scar(X1,X2),
inference(spm,[status(thm)],[c_0_809,c_0_810]) ).
cnf(c_0_812,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_813,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_811,c_0_812]) ).
cnf(c_0_814,plain,
( member(X1,cons(X2,X3))
| ~ member(X1,X3) ),
i_0_667 ).
cnf(c_0_815,plain,
( ~ member(X1,cons(familiename_1_1,cons(name_1_1,nil)))
| ~ attr(X2,X3)
| ~ sub(X3,X1) ),
inference(spm,[status(thm)],[c_0_813,c_0_814]) ).
cnf(c_0_816,plain,
( ~ member(X1,cons(name_1_1,nil))
| ~ attr(X2,X3)
| ~ sub(X3,X1) ),
inference(spm,[status(thm)],[c_0_815,c_0_814]) ).
cnf(c_0_817,plain,
member(X1,cons(X1,X2)),
i_0_666 ).
cnf(c_0_818,plain,
( ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_816,c_0_817]) ).
cnf(c_0_819,hypothesis,
attr(c17940,c17941),
i_0_295 ).
cnf(c_0_820,hypothesis,
sub(c17941,name_1_1),
i_0_293 ).
cnf(c_0_821,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_818,c_0_819]),c_0_820])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CSR113+9 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Sat Jun 11 14:23:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected SinE mode:
% 0.39/0.58 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.39/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.39/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.09/2.67 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 5.09/2.67 # Version: 2.1pre011
% 5.09/2.67 # Preprocessing time : 0.020 s
% 5.09/2.67
% 5.09/2.67 # Proof found!
% 5.09/2.67 # SZS status Theorem
% 5.09/2.67 # SZS output start CNFRefutation
% See solution above
% 5.09/2.67 # Proof object total steps : 25
% 5.09/2.67 # Proof object clause steps : 16
% 5.09/2.67 # Proof object formula steps : 9
% 5.09/2.67 # Proof object conjectures : 3
% 5.09/2.67 # Proof object clause conjectures : 2
% 5.09/2.67 # Proof object formula conjectures : 1
% 5.09/2.67 # Proof object initial clauses used : 9
% 5.09/2.67 # Proof object initial formulas used : 9
% 5.09/2.67 # Proof object generating inferences : 7
% 5.09/2.67 # Proof object simplifying inferences : 4
% 5.09/2.67 # Training examples: 0 positive, 0 negative
% 5.09/2.67 # Parsed axioms : 816
% 5.09/2.67 # Removed by relevancy pruning/SinE : 0
% 5.09/2.67 # Initial clauses : 816
% 5.09/2.67 # Removed in clause preprocessing : 0
% 5.09/2.67 # Initial clauses in saturation : 816
% 5.09/2.67 # Processed clauses : 945
% 5.09/2.67 # ...of these trivial : 2
% 5.09/2.67 # ...subsumed : 18
% 5.09/2.67 # ...remaining for further processing : 925
% 5.09/2.67 # Other redundant clauses eliminated : 0
% 5.09/2.67 # Clauses deleted for lack of memory : 0
% 5.09/2.67 # Backward-subsumed : 66
% 5.09/2.67 # Backward-rewritten : 0
% 5.09/2.67 # Generated clauses : 1883
% 5.09/2.67 # ...of the previous two non-trivial : 1879
% 5.09/2.67 # Contextual simplify-reflections : 4
% 5.09/2.67 # Paramodulations : 1883
% 5.09/2.67 # Factorizations : 0
% 5.09/2.67 # Equation resolutions : 0
% 5.09/2.67 # Propositional unsat checks : 0
% 5.09/2.67 # Propositional unsat check successes : 0
% 5.09/2.67 # Current number of processed clauses : 859
% 5.09/2.67 # Positive orientable unit clauses : 539
% 5.09/2.67 # Positive unorientable unit clauses: 0
% 5.09/2.67 # Negative unit clauses : 8
% 5.09/2.67 # Non-unit-clauses : 312
% 5.09/2.67 # Current number of unprocessed clauses: 1540
% 5.09/2.67 # ...number of literals in the above : 4665
% 5.09/2.67 # Current number of archived formulas : 0
% 5.09/2.67 # Current number of archived clauses : 66
% 5.09/2.67 # Clause-clause subsumption calls (NU) : 30062
% 5.09/2.67 # Rec. Clause-clause subsumption calls : 10465
% 5.09/2.67 # Non-unit clause-clause subsumptions : 70
% 5.09/2.67 # Unit Clause-clause subsumption calls : 5145
% 5.09/2.67 # Rewrite failures with RHS unbound : 0
% 5.09/2.67 # BW rewrite match attempts : 0
% 5.09/2.67 # BW rewrite match successes : 0
% 5.09/2.67 # Condensation attempts : 0
% 5.09/2.67 # Condensation successes : 0
% 5.09/2.67 # Termbank termtop insertions : 35590
% 5.09/2.67
% 5.09/2.67 # -------------------------------------------------
% 5.09/2.67 # User time : 0.060 s
% 5.09/2.67 # System time : 0.003 s
% 5.09/2.67 # Total time : 0.063 s
% 5.09/2.67 # ...preprocessing : 0.020 s
% 5.09/2.67 # ...main loop : 0.042 s
% 5.09/2.67 # Maximum resident set size: 9972 pages
% 5.09/2.67
%------------------------------------------------------------------------------