TSTP Solution File: CSR114+18 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR114+18 : TPTP v8.1.0. Released v4.0.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 : Fri Jul 15 02:49:07 EDT 2022
% Result : Theorem 6.99s 2.62s
% Output : CNFRefutation 6.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 13 unt; 0 nHn; 25 RR)
% Number of literals : 59 ( 0 equ; 40 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 34 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_772,negated_conjecture,
( ~ in(X1,X2)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ attr(X2,X5)
| ~ subs(X3,stehen_1_1)
| ~ sub(X5,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X5,rom_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_772) ).
cnf(i_0_254,hypothesis,
val(c197,rom_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_254) ).
cnf(i_0_255,hypothesis,
sub(c197,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_255) ).
cnf(i_0_640,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_640) ).
cnf(i_0_639,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_639) ).
cnf(i_0_641,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_641) ).
cnf(i_0_250,hypothesis,
loc(c205,c244),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_250) ).
cnf(i_0_245,hypothesis,
in(c244,c196),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_245) ).
cnf(i_0_257,hypothesis,
attr(c196,c197),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_257) ).
cnf(i_0_256,hypothesis,
sub(c196,stadt__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2mfl3dx3/input.p',i_0_256) ).
cnf(c_0_783,negated_conjecture,
( ~ in(X1,X2)
| ~ loc(X3,X1)
| ~ scar(X3,X4)
| ~ attr(X2,X5)
| ~ subs(X3,stehen_1_1)
| ~ sub(X5,name_1_1)
| ~ sub(X2,stadt__1_1)
| ~ val(X5,rom_0) ),
i_0_772 ).
cnf(c_0_784,hypothesis,
val(c197,rom_0),
i_0_254 ).
cnf(c_0_785,hypothesis,
sub(c197,name_1_1),
i_0_255 ).
cnf(c_0_786,negated_conjecture,
( ~ scar(X1,X2)
| ~ attr(X3,c197)
| ~ sub(X3,stadt__1_1)
| ~ loc(X1,X4)
| ~ subs(X1,stehen_1_1)
| ~ in(X4,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_783,c_0_784]),c_0_785])]) ).
cnf(c_0_787,plain,
( scar(esk27_2(X1,X2),X1)
| ~ loc(X1,X2) ),
i_0_640 ).
cnf(c_0_788,plain,
( subs(esk27_2(X1,X2),stehen_1_1)
| ~ loc(X1,X2) ),
i_0_639 ).
cnf(c_0_789,plain,
( ~ attr(X1,c197)
| ~ sub(X1,stadt__1_1)
| ~ loc(esk27_2(X2,X3),X4)
| ~ loc(X2,X3)
| ~ in(X4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_786,c_0_787]),c_0_788]) ).
cnf(c_0_790,plain,
( loc(esk27_2(X1,X2),X2)
| ~ loc(X1,X2) ),
i_0_641 ).
cnf(c_0_791,plain,
( ~ attr(X1,c197)
| ~ sub(X1,stadt__1_1)
| ~ loc(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_789,c_0_790]) ).
cnf(c_0_792,hypothesis,
loc(c205,c244),
i_0_250 ).
cnf(c_0_793,hypothesis,
( ~ attr(X1,c197)
| ~ sub(X1,stadt__1_1)
| ~ in(c244,X1) ),
inference(spm,[status(thm)],[c_0_791,c_0_792]) ).
cnf(c_0_794,hypothesis,
in(c244,c196),
i_0_245 ).
cnf(c_0_795,hypothesis,
attr(c196,c197),
i_0_257 ).
cnf(c_0_796,hypothesis,
sub(c196,stadt__1_1),
i_0_256 ).
cnf(c_0_797,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_793,c_0_794]),c_0_795]),c_0_796])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR114+18 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 10 14:59:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.38/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.38/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.38/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.99/2.62 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.99/2.62 # Version: 2.1pre011
% 6.99/2.62 # Preprocessing time : 0.023 s
% 6.99/2.62
% 6.99/2.62 # Proof found!
% 6.99/2.62 # SZS status Theorem
% 6.99/2.62 # SZS output start CNFRefutation
% See solution above
% 6.99/2.62 # Proof object total steps : 25
% 6.99/2.62 # Proof object clause steps : 15
% 6.99/2.62 # Proof object formula steps : 10
% 6.99/2.62 # Proof object conjectures : 3
% 6.99/2.62 # Proof object clause conjectures : 2
% 6.99/2.62 # Proof object formula conjectures : 1
% 6.99/2.62 # Proof object initial clauses used : 10
% 6.99/2.62 # Proof object initial formulas used : 10
% 6.99/2.62 # Proof object generating inferences : 5
% 6.99/2.62 # Proof object simplifying inferences : 6
% 6.99/2.62 # Training examples: 0 positive, 0 negative
% 6.99/2.62 # Parsed axioms : 792
% 6.99/2.62 # Removed by relevancy pruning/SinE : 0
% 6.99/2.62 # Initial clauses : 792
% 6.99/2.62 # Removed in clause preprocessing : 0
% 6.99/2.62 # Initial clauses in saturation : 792
% 6.99/2.62 # Processed clauses : 810
% 6.99/2.62 # ...of these trivial : 0
% 6.99/2.62 # ...subsumed : 2
% 6.99/2.62 # ...remaining for further processing : 808
% 6.99/2.62 # Other redundant clauses eliminated : 0
% 6.99/2.62 # Clauses deleted for lack of memory : 0
% 6.99/2.62 # Backward-subsumed : 3
% 6.99/2.62 # Backward-rewritten : 0
% 6.99/2.62 # Generated clauses : 1721
% 6.99/2.62 # ...of the previous two non-trivial : 1720
% 6.99/2.62 # Contextual simplify-reflections : 3
% 6.99/2.62 # Paramodulations : 1721
% 6.99/2.62 # Factorizations : 0
% 6.99/2.62 # Equation resolutions : 0
% 6.99/2.62 # Propositional unsat checks : 0
% 6.99/2.62 # Propositional unsat check successes : 0
% 6.99/2.62 # Current number of processed clauses : 805
% 6.99/2.62 # Positive orientable unit clauses : 487
% 6.99/2.62 # Positive unorientable unit clauses: 0
% 6.99/2.62 # Negative unit clauses : 0
% 6.99/2.62 # Non-unit-clauses : 318
% 6.99/2.62 # Current number of unprocessed clauses: 1682
% 6.99/2.62 # ...number of literals in the above : 5220
% 6.99/2.62 # Current number of archived formulas : 0
% 6.99/2.62 # Current number of archived clauses : 3
% 6.99/2.62 # Clause-clause subsumption calls (NU) : 33202
% 6.99/2.62 # Rec. Clause-clause subsumption calls : 12443
% 6.99/2.62 # Non-unit clause-clause subsumptions : 8
% 6.99/2.62 # Unit Clause-clause subsumption calls : 537
% 6.99/2.62 # Rewrite failures with RHS unbound : 0
% 6.99/2.62 # BW rewrite match attempts : 0
% 6.99/2.62 # BW rewrite match successes : 0
% 6.99/2.62 # Condensation attempts : 0
% 6.99/2.62 # Condensation successes : 0
% 6.99/2.62 # Termbank termtop insertions : 33465
% 6.99/2.62
% 6.99/2.62 # -------------------------------------------------
% 6.99/2.62 # User time : 0.050 s
% 6.99/2.62 # System time : 0.007 s
% 6.99/2.62 # Total time : 0.057 s
% 6.99/2.62 # ...preprocessing : 0.023 s
% 6.99/2.62 # ...main loop : 0.034 s
% 6.99/2.62 # Maximum resident set size: 9968 pages
% 6.99/2.62
%------------------------------------------------------------------------------